Base | Representation |
---|---|
bin | 11110000010101001010… |
… | …00101101111100001001 |
3 | 10122200022122012012211101 |
4 | 33001110220231330021 |
5 | 113402432300023423 |
6 | 2110105223501401 |
7 | 134401115115301 |
oct | 17012450557411 |
9 | 3580278165741 |
10 | 1032212111113 |
11 | 368838910827 |
12 | 1480718b7861 |
13 | 7644ca42a11 |
14 | 37d605a2601 |
15 | 1bcb46a07ad |
hex | f054a2df09 |
1032212111113 has 2 divisors, whose sum is σ = 1032212111114. Its totient is φ = 1032212111112.
The previous prime is 1032212111111. The next prime is 1032212111149. The reversal of 1032212111113 is 3111112122301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 855195853824 + 177016257289 = 924768^2 + 420733^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032212111113 - 21 = 1032212111111 is a prime.
Together with 1032212111111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1032212111111) 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, 516106055556 + 516106055557.
It is an arithmetic number, because the mean of its divisors is an integer number (516106055557).
Almost surely, 21032212111113 is an apocalyptic number.
It is an amenable number.
1032212111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032212111113 is an equidigital number, since it uses as much as digits as its factorization.
1032212111113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1032212111113 its reverse (3111112122301), we get a palindrome (4143324233414).
The spelling of 1032212111113 in words is "one trillion, thirty-two billion, two hundred twelve million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •