Base | Representation |
---|---|
bin | 11110000010110011110… |
… | …00110000110001100111 |
3 | 10122200112202221202022222 |
4 | 33001121320300301213 |
5 | 113403122322444421 |
6 | 2110122051542555 |
7 | 134403234643262 |
oct | 17013170606147 |
9 | 3580482852288 |
10 | 1032300203111 |
11 | 368883609631 |
12 | 1480972baa5b |
13 | 76465077368 |
14 | 37d6c173cd9 |
15 | 1bcbc2a1cab |
hex | f059e30c67 |
1032300203111 has 2 divisors, whose sum is σ = 1032300203112. Its totient is φ = 1032300203110.
The previous prime is 1032300203087. The next prime is 1032300203113. The reversal of 1032300203111 is 1113020032301.
1032300203111 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 1032300203111 - 26 = 1032300203047 is a prime.
Together with 1032300203113, 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 1032300203111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032300203113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516150101555 + 516150101556.
It is an arithmetic number, because the mean of its divisors is an integer number (516150101556).
Almost surely, 21032300203111 is an apocalyptic number.
1032300203111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032300203111 is an equidigital number, since it uses as much as digits as its factorization.
1032300203111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1032300203111 its reverse (1113020032301), we get a palindrome (2145320235412).
The spelling of 1032300203111 in words is "one trillion, thirty-two billion, three hundred million, two hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •