Base | Representation |
---|---|
bin | 11101111110100011000… |
… | …00110110000110101111 |
3 | 10122110122022201210011022 |
4 | 32333101200312012233 |
5 | 113333431112411421 |
6 | 2105103040444355 |
7 | 134262443342012 |
oct | 16772140660657 |
9 | 3573568653138 |
10 | 1030012232111 |
11 | 36790a064105 |
12 | 1477590196bb |
13 | 7618c054475 |
14 | 37bd2357379 |
15 | 1bbd64a97ab |
hex | efd18361af |
1030012232111 has 2 divisors, whose sum is σ = 1030012232112. Its totient is φ = 1030012232110.
The previous prime is 1030012231933. The next prime is 1030012232143. The reversal of 1030012232111 is 1112322100301.
It is a strong prime.
It is an emirp because it is prime and its reverse (1112322100301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1030012232111 - 226 = 1029945123247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1030012232111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030012532111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515006116055 + 515006116056.
It is an arithmetic number, because the mean of its divisors is an integer number (515006116056).
Almost surely, 21030012232111 is an apocalyptic number.
1030012232111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030012232111 is an equidigital number, since it uses as much as digits as its factorization.
1030012232111 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 17.
Adding to 1030012232111 its reverse (1112322100301), we get a palindrome (2142334332412).
The spelling of 1030012232111 in words is "one trillion, thirty billion, twelve million, two hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •