Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …00010100101010111011 |
3 | 10120202102000022100220111 |
4 | 32232211320110222323 |
5 | 113040240140214211 |
6 | 2052541422205151 |
7 | 133056534526501 |
oct | 16564570245273 |
9 | 3522360270814 |
10 | 1012100319931 |
11 | 3602582773a8 |
12 | 14419a4237b7 |
13 | 7459615666c |
14 | 36db34da671 |
15 | 1b4d8c01421 |
hex | eba5e14abb |
1012100319931 has 2 divisors, whose sum is σ = 1012100319932. Its totient is φ = 1012100319930.
The previous prime is 1012100319913. The next prime is 1012100320069. The reversal of 1012100319931 is 1399130012101.
Together with previous prime (1012100319913) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1012100319931 - 229 = 1011563449019 is a prime.
It is a super-2 number, since 2×10121003199312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012100319893 and 1012100319902.
It is not a weakly prime, because it can be changed into another prime (1012100319731) 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, 506050159965 + 506050159966.
It is an arithmetic number, because the mean of its divisors is an integer number (506050159966).
Almost surely, 21012100319931 is an apocalyptic number.
1012100319931 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012100319931 is an equidigital number, since it uses as much as digits as its factorization.
1012100319931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 1012100319931 in words is "one trillion, twelve billion, one hundred million, three hundred nineteen thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •