Base | Representation |
---|---|
bin | 10001100110111001101… |
… | …000000100111011111001 |
3 | 11021200012222122212210202 |
4 | 101212321220010323321 |
5 | 124311040011213423 |
6 | 2323511045251545 |
7 | 153263634105536 |
oct | 21467150047371 |
9 | 4250188585722 |
10 | 1210000101113 |
11 | 427181570071 |
12 | 17660a703bb5 |
13 | 8a14430c1bb |
14 | 427c86b5d8d |
15 | 2171cab8728 |
hex | 119b9a04ef9 |
1210000101113 has 2 divisors, whose sum is σ = 1210000101114. Its totient is φ = 1210000101112.
The previous prime is 1210000101109. The next prime is 1210000101157. The reversal of 1210000101113 is 3111010000121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1180499634064 + 29500467049 = 1086508^2 + 171757^2 .
It is an emirp because it is prime and its reverse (3111010000121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210000101113 - 22 = 1210000101109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210000101094 and 1210000101103.
It is not a weakly prime, because it can be changed into another prime (1210000106113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605000050556 + 605000050557.
It is an arithmetic number, because the mean of its divisors is an integer number (605000050557).
Almost surely, 21210000101113 is an apocalyptic number.
It is an amenable number.
1210000101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210000101113 is an equidigital number, since it uses as much as digits as its factorization.
1210000101113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1210000101113 its reverse (3111010000121), we get a palindrome (4321010101234).
The spelling of 1210000101113 in words is "one trillion, two hundred ten billion, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •