Base | Representation |
---|---|
bin | 10110110010001111111011… |
… | …100010001010100000011001 |
3 | 111010210222210022100000012111 |
4 | 112302033323202022200121 |
5 | 101113320242104120441 |
6 | 553043515122112321 |
7 | 30051640513636042 |
oct | 2662177342124031 |
9 | 433728708300174 |
10 | 100210102020121 |
11 | 29a25958133635 |
12 | b2a54804ab6a1 |
13 | 43bba06322702 |
14 | 1aa62a28118c9 |
15 | b8ba64a55081 |
hex | 5b23fb88a819 |
100210102020121 has 2 divisors, whose sum is σ = 100210102020122. Its totient is φ = 100210102020120.
The previous prime is 100210102020113. The next prime is 100210102020221. The reversal of 100210102020121 is 121020201012001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98824276281600 + 1385825738521 = 9941040^2 + 1177211^2 .
It is a cyclic number.
It is not a de Polignac number, because 100210102020121 - 23 = 100210102020113 is a prime.
It is not a weakly prime, because it can be changed into another prime (100210102020221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105051010060 + 50105051010061.
It is an arithmetic number, because the mean of its divisors is an integer number (50105051010061).
Almost surely, 2100210102020121 is an apocalyptic number.
It is an amenable number.
100210102020121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210102020121 is an equidigital number, since it uses as much as digits as its factorization.
100210102020121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100210102020121 its reverse (121020201012001), we get a palindrome (221230303032122).
The spelling of 100210102020121 in words is "one hundred trillion, two hundred ten billion, one hundred two million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •