Base | Representation |
---|---|
bin | 111101111111010… |
… | …111001010011100 |
3 | 2200110222111101212 |
4 | 331333113022130 |
5 | 4112221120444 |
6 | 251111123552 |
7 | 34526011433 |
oct | 7577271234 |
9 | 2613874355 |
10 | 1040020124 |
11 | 494078570 |
12 | 2503735b8 |
13 | 13760cc30 |
14 | 9c1a811a |
15 | 6148919e |
hex | 3dfd729c |
1040020124 has 96 divisors (see below), whose sum is σ = 2217061056. Its totient is φ = 420526080.
The previous prime is 1040020109. The next prime is 1040020139. The reversal of 1040020124 is 4210200401.
It is an interprime number because it is at equal distance from previous prime (1040020109) and next prime (1040020139).
It is a super-3 number, since 3×10400201243 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1040020099 and 1040020108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3322592 + ... + 3322904.
It is an arithmetic number, because the mean of its divisors is an integer number (23094386).
Almost surely, 21040020124 is an apocalyptic number.
It is an amenable number.
1040020124 is an abundant number, since it is smaller than the sum of its proper divisors (1177040932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040020124 is a wasteful number, since it uses less digits than its factorization.
1040020124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535 (or 533 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 1040020124 is about 32249.3430010597. The cubic root of 1040020124 is about 1013.1659386562.
Adding to 1040020124 its reverse (4210200401), we get a palindrome (5250220525).
The spelling of 1040020124 in words is "one billion, forty million, twenty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •