Base | Representation |
---|---|
bin | 11110000010101001010… |
… | …00101101111100000111 |
3 | 10122200022122012012211022 |
4 | 33001110220231330013 |
5 | 113402432300023421 |
6 | 2110105223501355 |
7 | 134401115115266 |
oct | 17012450557407 |
9 | 3580278165738 |
10 | 1032212111111 |
11 | 368838910825 |
12 | 1480718b785b |
13 | 7644ca42a0c |
14 | 37d605a25dd |
15 | 1bcb46a07ab |
hex | f054a2df07 |
1032212111111 has 2 divisors, whose sum is σ = 1032212111112. Its totient is φ = 1032212111110.
The previous prime is 1032212111087. The next prime is 1032212111113. The reversal of 1032212111111 is 1111112122301.
1032212111111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1032212111111 - 222 = 1032207916807 is a prime.
Together with 1032212111113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1032212111111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032212111113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516106055555 + 516106055556.
It is an arithmetic number, because the mean of its divisors is an integer number (516106055556).
Almost surely, 21032212111111 is an apocalyptic number.
1032212111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032212111111 is an equidigital number, since it uses as much as digits as its factorization.
1032212111111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1032212111111 its reverse (1111112122301), we get a palindrome (2143324233412).
The spelling of 1032212111111 in words is "one trillion, thirty-two billion, two hundred twelve million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •