Base | Representation |
---|---|
bin | 1001001100000101010111… |
… | …0101101010101110110011 |
3 | 1022202212010121021122011101 |
4 | 2103001111311222232303 |
5 | 2311012330010242321 |
6 | 33253203020025231 |
7 | 2061634536232024 |
oct | 223012565525663 |
9 | 38685117248141 |
10 | 10103203212211 |
11 | 324582090693a |
12 | 117209a392217 |
13 | 58396048c8b5 |
14 | 26cdd7772c4b |
15 | 127c1a4b2791 |
hex | 93055d6abb3 |
10103203212211 has 2 divisors, whose sum is σ = 10103203212212. Its totient is φ = 10103203212210.
The previous prime is 10103203212163. The next prime is 10103203212229. The reversal of 10103203212211 is 11221230230101.
It is a strong prime.
It is an emirp because it is prime and its reverse (11221230230101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10103203212211 - 237 = 9965764258739 is a prime.
It is not a weakly prime, because it can be changed into another prime (10103203212251) 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, 5051601606105 + 5051601606106.
It is an arithmetic number, because the mean of its divisors is an integer number (5051601606106).
Almost surely, 210103203212211 is an apocalyptic number.
10103203212211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103203212211 is an equidigital number, since it uses as much as digits as its factorization.
10103203212211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10103203212211 its reverse (11221230230101), we get a palindrome (21324433442312).
The spelling of 10103203212211 in words is "ten trillion, one hundred three billion, two hundred three million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •