Base | Representation |
---|---|
bin | 10011010111111100… |
… | …10010011011100100 |
3 | 222211220010010212120 |
4 | 21223332102123210 |
5 | 132300231100444 |
6 | 4440042345540 |
7 | 515520440406 |
oct | 115376223344 |
9 | 28756103776 |
10 | 10401425124 |
11 | 4458373712 |
12 | 20234bb2b0 |
13 | c99c0a62c |
14 | 7095b8b76 |
15 | 40d253b19 |
hex | 26bf926e4 |
10401425124 has 12 divisors (see below), whose sum is σ = 24269991984. Its totient is φ = 3467141704.
The previous prime is 10401425087. The next prime is 10401425141. The reversal of 10401425124 is 42152410401.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×104014251242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10401425094 and 10401425103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 433392702 + ... + 433392725.
It is an arithmetic number, because the mean of its divisors is an integer number (2022499332).
Almost surely, 210401425124 is an apocalyptic number.
It is an amenable number.
10401425124 is an abundant number, since it is smaller than the sum of its proper divisors (13868566860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10401425124 is a wasteful number, since it uses less digits than its factorization.
10401425124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 866785434 (or 866785432 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 10401425124 its reverse (42152410401), we get a palindrome (52553835525).
The spelling of 10401425124 in words is "ten billion, four hundred one million, four hundred twenty-five thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •