Base | Representation |
---|---|
bin | 11101011101110100100… |
… | …00001000000011011111 |
3 | 10120210021211102210112212 |
4 | 32232322100020003133 |
5 | 113041440134312111 |
6 | 2053035351551035 |
7 | 133101154614551 |
oct | 16567220100337 |
9 | 3523254383485 |
10 | 1012442104031 |
11 | 36041319a8a6 |
12 | 14427498b47b |
13 | 7461bbc4087 |
14 | 37006a694d1 |
15 | 1b508c1598b |
hex | ebba4080df |
1012442104031 has 2 divisors, whose sum is σ = 1012442104032. Its totient is φ = 1012442104030.
The previous prime is 1012442104027. The next prime is 1012442104111. The reversal of 1012442104031 is 1304012442101.
1012442104031 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 1012442104031 - 22 = 1012442104027 is a prime.
It is a super-2 number, since 2×10124421040312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012442103988 and 1012442104006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012442104231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506221052015 + 506221052016.
It is an arithmetic number, because the mean of its divisors is an integer number (506221052016).
Almost surely, 21012442104031 is an apocalyptic number.
1012442104031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012442104031 is an equidigital number, since it uses as much as digits as its factorization.
1012442104031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1012442104031 its reverse (1304012442101), we get a palindrome (2316454546132).
The spelling of 1012442104031 in words is "one trillion, twelve billion, four hundred forty-two million, one hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •