Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …0111111110110110010101 |
3 | 1022102012011112222110012221 |
4 | 2101203023213332312111 |
5 | 2302333300112332411 |
6 | 33134522405542341 |
7 | 2051425236154063 |
oct | 221431347766625 |
9 | 38365145873187 |
10 | 10002100120981 |
11 | 3206959844aa1 |
12 | 11565831149b1 |
13 | 57726a289467 |
14 | 26816600b033 |
15 | 12529e4d1071 |
hex | 918cb9fed95 |
10002100120981 has 2 divisors, whose sum is σ = 10002100120982. Its totient is φ = 10002100120980.
The previous prime is 10002100120973. The next prime is 10002100121053. The reversal of 10002100120981 is 18902100120001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6141822192900 + 3860277928081 = 2478270^2 + 1964759^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002100120981 - 23 = 10002100120973 is a prime.
It is a super-2 number, since 2×100021001209812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002100120381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001050060490 + 5001050060491.
It is an arithmetic number, because the mean of its divisors is an integer number (5001050060491).
Almost surely, 210002100120981 is an apocalyptic number.
It is an amenable number.
10002100120981 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002100120981 is an equidigital number, since it uses as much as digits as its factorization.
10002100120981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
Adding to 10002100120981 its reverse (18902100120001), we get a palindrome (28904200240982).
The spelling of 10002100120981 in words is "ten trillion, two billion, one hundred million, one hundred twenty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •