Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …011111010101010100101 |
3 | 10221012222022020222010021 |
4 | 100022303123322222211 |
5 | 121201024133032323 |
6 | 2210234322155141 |
7 | 143163251121313 |
oct | 20126333725245 |
9 | 3835868228107 |
10 | 1111112002213 |
11 | 3992468387a4 |
12 | 15b4111b2ab1 |
13 | 80a14c89405 |
14 | 3bac71b10b3 |
15 | 1dd812b605d |
hex | 102b36faaa5 |
1111112002213 has 2 divisors, whose sum is σ = 1111112002214. Its totient is φ = 1111112002212.
The previous prime is 1111112002193. The next prime is 1111112002229. The reversal of 1111112002213 is 3122002111111.
It is a happy number.
It is an a-pointer prime, because the next prime (1111112002229) can be obtained adding 1111112002213 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1053203430049 + 57908572164 = 1026257^2 + 240642^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111112002213 - 229 = 1110575131301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111112002513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555556001106 + 555556001107.
It is an arithmetic number, because the mean of its divisors is an integer number (555556001107).
Almost surely, 21111112002213 is an apocalyptic number.
It is an amenable number.
1111112002213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111112002213 is an equidigital number, since it uses as much as digits as its factorization.
1111112002213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1111112002213 its reverse (3122002111111), we get a palindrome (4233114113324).
The spelling of 1111112002213 in words is "one trillion, one hundred eleven billion, one hundred twelve million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.711 sec. • engine limits •