Base | Representation |
---|---|
bin | 10000001100110000101… |
… | …011011000111001110011 |
3 | 10221102101202001101122022 |
4 | 100030300223120321303 |
5 | 121214330040211402 |
6 | 2211223022302055 |
7 | 143266314106226 |
oct | 20146053307163 |
9 | 3842352041568 |
10 | 1113213210227 |
11 | 39a124921448 |
12 | 15b8b8a2792b |
13 | 80c8b3ab071 |
14 | 3bc462935bd |
15 | 1de559bb2a2 |
hex | 10330ad8e73 |
1113213210227 has 2 divisors, whose sum is σ = 1113213210228. Its totient is φ = 1113213210226.
The previous prime is 1113213210199. The next prime is 1113213210253. The reversal of 1113213210227 is 7220123123111.
It is an a-pointer prime, because the next prime (1113213210253) can be obtained adding 1113213210227 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113213210227 - 220 = 1113212161651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113213210196 and 1113213210205.
It is not a weakly prime, because it can be changed into another prime (1113213270227) 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, 556606605113 + 556606605114.
It is an arithmetic number, because the mean of its divisors is an integer number (556606605114).
Almost surely, 21113213210227 is an apocalyptic number.
1113213210227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113213210227 is an equidigital number, since it uses as much as digits as its factorization.
1113213210227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 1113213210227 its reverse (7220123123111), we get a palindrome (8333336333338).
The spelling of 1113213210227 in words is "one trillion, one hundred thirteen billion, two hundred thirteen million, two hundred ten thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •