Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …1000010101010100011011 |
3 | 1022202202002012221222200002 |
4 | 2103000033120111110123 |
5 | 2311002414401222321 |
6 | 33252445431403215 |
7 | 2061563333465642 |
oct | 223001730252433 |
9 | 38682065858602 |
10 | 10102021117211 |
11 | 324527461a421 |
12 | 1171a0a52350b |
13 | 5838025c70ba |
14 | 26cd24784359 |
15 | 127b9b81220b |
hex | 9300f61551b |
10102021117211 has 2 divisors, whose sum is σ = 10102021117212. Its totient is φ = 10102021117210.
The previous prime is 10102021117207. The next prime is 10102021117213. The reversal of 10102021117211 is 11271112020101.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (11271112020101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10102021117211 - 22 = 10102021117207 is a prime.
Together with 10102021117213, 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 (10102021117213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051010558605 + 5051010558606.
It is an arithmetic number, because the mean of its divisors is an integer number (5051010558606).
Almost surely, 210102021117211 is an apocalyptic number.
10102021117211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102021117211 is an equidigital number, since it uses as much as digits as its factorization.
10102021117211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 10102021117211 its reverse (11271112020101), we get a palindrome (21373133137312).
The spelling of 10102021117211 in words is "ten trillion, one hundred two billion, twenty-one million, one hundred seventeen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •