Base | Representation |
---|---|
bin | 1001001011111101100010… |
… | …0010011010010011111101 |
3 | 1022202122201002121210220111 |
4 | 2102333120202122103331 |
5 | 2310444023324342341 |
6 | 33252214242350021 |
7 | 2061531461643052 |
oct | 222773042322375 |
9 | 38678632553814 |
10 | 10101101012221 |
11 | 324494220597a |
12 | 11717b235b311 |
13 | 5836b6ab158b |
14 | 26cc784b3029 |
15 | 127b45b63681 |
hex | 92fd889a4fd |
10101101012221 has 2 divisors, whose sum is σ = 10101101012222. Its totient is φ = 10101101012220.
The previous prime is 10101101012153. The next prime is 10101101012227. The reversal of 10101101012221 is 12221010110101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7560360651321 + 2540740360900 = 2749611^2 + 1593970^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101101012221 - 29 = 10101101011709 is a prime.
It is a super-2 number, since 2×101011010122212 (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 (10101101012227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050550506110 + 5050550506111.
It is an arithmetic number, because the mean of its divisors is an integer number (5050550506111).
Almost surely, 210101101012221 is an apocalyptic number.
It is an amenable number.
10101101012221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101101012221 is an equidigital number, since it uses as much as digits as its factorization.
10101101012221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10101101012221 its reverse (12221010110101), we get a palindrome (22322111122322).
The spelling of 10101101012221 in words is "ten trillion, one hundred one billion, one hundred one million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •