Base | Representation |
---|---|
bin | 1001000111010011111111… |
… | …1111001001101101101111 |
3 | 1022111000112220101211120101 |
4 | 2101310333333021231233 |
5 | 2303141440422033124 |
6 | 33151405053131531 |
7 | 2053003322265334 |
oct | 221647777115557 |
9 | 38430486354511 |
10 | 10021232221039 |
11 | 3213a87376a36 |
12 | 115a222489ba7 |
13 | 578cc8bc9520 |
14 | 26905cd3098b |
15 | 125a1de61644 |
hex | 91d3ffc9b6f |
10021232221039 has 8 divisors (see below), whose sum is σ = 10793248017552. Its totient is φ = 9249380964480.
The previous prime is 10021232221037. The next prime is 10021232221051. The reversal of 10021232221039 is 93012223212001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10021232221039 - 21 = 10021232221037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021232220998 and 10021232221016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021232221037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41008474 + ... + 41252119.
It is an arithmetic number, because the mean of its divisors is an integer number (1349156002194).
Almost surely, 210021232221039 is an apocalyptic number.
10021232221039 is a deficient number, since it is larger than the sum of its proper divisors (772015796513).
10021232221039 is an equidigital number, since it uses as much as digits as its factorization.
10021232221039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82269977.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 10021232221039 in words is "ten trillion, twenty-one billion, two hundred thirty-two million, two hundred twenty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •