Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1011001100010010011001 |
3 | 1022202112212101021101001102 |
4 | 2102332112323030102121 |
5 | 2310434300023241441 |
6 | 33251513120401145 |
7 | 2061462264205241 |
oct | 222762673142231 |
9 | 38675771241042 |
10 | 10100000212121 |
11 | 32444278a4526 |
12 | 11715457761b5 |
13 | 58356ca10681 |
14 | 26cbb2206b21 |
15 | 127ace1c069b |
hex | 92f96ecc499 |
10100000212121 has 2 divisors, whose sum is σ = 10100000212122. Its totient is φ = 10100000212120.
The previous prime is 10100000212091. The next prime is 10100000212123. The reversal of 10100000212121 is 12121200000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6448323816025 + 3651676396096 = 2539355^2 + 1910936^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100000212121 - 222 = 10099996017817 is a prime.
Together with 10100000212123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10100000212123) 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, 5050000106060 + 5050000106061.
It is an arithmetic number, because the mean of its divisors is an integer number (5050000106061).
Almost surely, 210100000212121 is an apocalyptic number.
It is an amenable number.
10100000212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100000212121 is an equidigital number, since it uses as much as digits as its factorization.
10100000212121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10100000212121 its reverse (12121200000101), we get a palindrome (22221200212222).
The spelling of 10100000212121 in words is "ten trillion, one hundred billion, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •