Base | Representation |
---|---|
bin | 1001001100100111010011… |
… | …0101101000101010100111 |
3 | 1022210201122111101121000011 |
4 | 2103021310311220222213 |
5 | 2311140004141411124 |
6 | 33301311011231051 |
7 | 2062406356146424 |
oct | 223116465505247 |
9 | 38721574347004 |
10 | 10112313232039 |
11 | 3249676212647 |
12 | 1173a012a8487 |
13 | 584782981285 |
14 | 26d61d626d4b |
15 | 1280a0172994 |
hex | 93274d68aa7 |
10112313232039 has 2 divisors, whose sum is σ = 10112313232040. Its totient is φ = 10112313232038.
The previous prime is 10112313232037. The next prime is 10112313232067. The reversal of 10112313232039 is 93023231321101.
It is a happy number.
10112313232039 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10112313232039 - 21 = 10112313232037 is a prime.
Together with 10112313232037, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10112313232039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112313232037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056156616019 + 5056156616020.
It is an arithmetic number, because the mean of its divisors is an integer number (5056156616020).
Almost surely, 210112313232039 is an apocalyptic number.
10112313232039 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112313232039 is an equidigital number, since it uses as much as digits as its factorization.
10112313232039 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 10112313232039 in words is "ten trillion, one hundred twelve billion, three hundred thirteen million, two hundred thirty-two thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •