Base | Representation |
---|---|
bin | 1001000110001100110000… |
… | …1101101101001111010001 |
3 | 1022102012012020120212211210 |
4 | 2101203030031231033101 |
5 | 2302333310130312241 |
6 | 33134523401530333 |
7 | 2051425416213012 |
oct | 221431415551721 |
9 | 38365166525753 |
10 | 10002110010321 |
11 | 320696438a000 |
12 | 11565864a39a9 |
13 | 57726c33c840 |
14 | 268167463009 |
15 | 1252a02d6316 |
hex | 918cc36d3d1 |
10002110010321 has 32 divisors (see below), whose sum is σ = 15797125572480. Its totient is φ = 5595585990720.
The previous prime is 10002110010317. The next prime is 10002110010323. The reversal of 10002110010321 is 12301001120001.
It is not a de Polignac number, because 10002110010321 - 22 = 10002110010317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002110010297 and 10002110010306.
It is not an unprimeable number, because it can be changed into a prime (10002110010323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96290826 + ... + 96394643.
It is an arithmetic number, because the mean of its divisors is an integer number (493660174140).
Almost surely, 210002110010321 is an apocalyptic number.
10002110010321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10002110010321 is a deficient number, since it is larger than the sum of its proper divisors (5795015562159).
10002110010321 is a wasteful number, since it uses less digits than its factorization.
10002110010321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192685518 (or 192685496 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10002110010321 its reverse (12301001120001), we get a palindrome (22303111130322).
The spelling of 10002110010321 in words is "ten trillion, two billion, one hundred ten million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •