Base | Representation |
---|---|
bin | 11110000010010001001… |
… | …10111100100010011111 |
3 | 10122122210120111011111121 |
4 | 33001020212330202133 |
5 | 113402024120220111 |
6 | 2110033214431411 |
7 | 134363114661145 |
oct | 17011046744237 |
9 | 3578716434447 |
10 | 1032010320031 |
11 | 368744a15139 |
12 | 148016202567 |
13 | 76419cac402 |
14 | 37d41875595 |
15 | 1bca1ae0871 |
hex | f0489bc89f |
1032010320031 has 2 divisors, whose sum is σ = 1032010320032. Its totient is φ = 1032010320030.
The previous prime is 1032010320023. The next prime is 1032010320037. The reversal of 1032010320031 is 1300230102301.
1032010320031 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 1032010320031 - 23 = 1032010320023 is a prime.
It is a super-2 number, since 2×10320103200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1032010319987 and 1032010320014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032010320037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516005160015 + 516005160016.
It is an arithmetic number, because the mean of its divisors is an integer number (516005160016).
Almost surely, 21032010320031 is an apocalyptic number.
1032010320031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032010320031 is an equidigital number, since it uses as much as digits as its factorization.
1032010320031 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 16.
Adding to 1032010320031 its reverse (1300230102301), we get a palindrome (2332240422332).
The spelling of 1032010320031 in words is "one trillion, thirty-two billion, ten million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •