Base | Representation |
---|---|
bin | 1001010100000101010010… |
… | …1110000101011001000001 |
3 | 1100020222211122121111120011 |
4 | 2111001110232011121001 |
5 | 2320240244042304023 |
6 | 33440251043344521 |
7 | 2104601123452312 |
oct | 225012456053101 |
9 | 40228748544504 |
10 | 10240623400513 |
11 | 3299029a342a0 |
12 | 1194850082141 |
13 | 5938c072999c |
14 | 2759124d6609 |
15 | 12b5ae99050d |
hex | 95054b85641 |
10240623400513 has 8 divisors (see below), whose sum is σ = 11175004547136. Its totient is φ = 9306811484400.
The previous prime is 10240623400507. The next prime is 10240623400517. The reversal of 10240623400513 is 31500432604201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10240623400513 is a prime.
It is a super-2 number, since 2×102406234005132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10240623400517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142270006 + ... + 142341967.
It is an arithmetic number, because the mean of its divisors is an integer number (1396875568392).
Almost surely, 210240623400513 is an apocalyptic number.
It is an amenable number.
10240623400513 is a deficient number, since it is larger than the sum of its proper divisors (934381146623).
10240623400513 is a wasteful number, since it uses less digits than its factorization.
10240623400513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284615255.
The product of its (nonzero) digits is 17280, while the sum is 31.
The spelling of 10240623400513 in words is "ten trillion, two hundred forty billion, six hundred twenty-three million, four hundred thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •