Base | Representation |
---|---|
bin | 1010001100100000111000… |
… | …0101101011011010111101 |
3 | 1110200200020012202221120012 |
4 | 2203020032011223122331 |
5 | 2432131241324342112 |
6 | 35501503241233005 |
7 | 2234621516261345 |
oct | 243101605533275 |
9 | 43620205687505 |
10 | 11210101012157 |
11 | 36321a4858043 |
12 | 1310714192765 |
13 | 634153339aa8 |
14 | 2aa800d91d25 |
15 | 1469017e1022 |
hex | a320e16b6bd |
11210101012157 has 2 divisors, whose sum is σ = 11210101012158. Its totient is φ = 11210101012156.
The previous prime is 11210101012057. The next prime is 11210101012169. The reversal of 11210101012157 is 75121010101211.
11210101012157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11208173275321 + 1927736836 = 3347861^2 + 43906^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210101012157 - 216 = 11210100946621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11210101012057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605050506078 + 5605050506079.
It is an arithmetic number, because the mean of its divisors is an integer number (5605050506079).
Almost surely, 211210101012157 is an apocalyptic number.
It is an amenable number.
11210101012157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210101012157 is an equidigital number, since it uses as much as digits as its factorization.
11210101012157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 140, while the sum is 23.
Adding to 11210101012157 its reverse (75121010101211), we get a palindrome (86331111113368).
The spelling of 11210101012157 in words is "eleven trillion, two hundred ten billion, one hundred one million, twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •