Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …011010100000000000100001 |
3 | 111010002002200011121221010102 |
4 | 112233032020122200000201 |
5 | 101101413110110412433 |
6 | 552404142403112145 |
7 | 30030623041441400 |
oct | 2657161032400041 |
9 | 433062604557112 |
10 | 100002012200993 |
11 | 29955684927601 |
12 | b271087672655 |
13 | 43a51c2ca2916 |
14 | 1a9a1a2165637 |
15 | b864362924e8 |
hex | 5af3886a0021 |
100002012200993 has 12 divisors (see below), whose sum is σ = 116761320687060. Its totient is φ = 85397363567712.
The previous prime is 100002012200921. The next prime is 100002012201053. The reversal of 100002012200993 is 399002210200001.
It can be written as a sum of positive squares in 2 ways, for example, as 14836301611264 + 85165710589729 = 3851792^2 + 9228527^2 .
It is not a de Polignac number, because 100002012200993 - 218 = 100002011938849 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100002012200593) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3793402046 + ... + 3793428407.
It is an arithmetic number, because the mean of its divisors is an integer number (9730110057255).
Almost surely, 2100002012200993 is an apocalyptic number.
It is an amenable number.
100002012200993 is a deficient number, since it is larger than the sum of its proper divisors (16759308486067).
100002012200993 is an equidigital number, since it uses as much as digits as its factorization.
100002012200993 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7586830736 (or 7586830729 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 29.
Adding to 100002012200993 its reverse (399002210200001), we get a palindrome (499004222400994).
The spelling of 100002012200993 in words is "one hundred trillion, two billion, twelve million, two hundred thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •