Base | Representation |
---|---|
bin | 11101011101000011100… |
… | …00101100100111110011 |
3 | 10120202020012021022200012 |
4 | 32232201300230213303 |
5 | 113040114442241034 |
6 | 2052530513045135 |
7 | 133055035236632 |
oct | 16564160544763 |
9 | 3522205238605 |
10 | 1012031212019 |
11 | 360222265623 |
12 | 14417b2567ab |
13 | 74584a3abc9 |
14 | 36da826b519 |
15 | 1b4d2aeecce |
hex | eba1c2c9f3 |
1012031212019 has 2 divisors, whose sum is σ = 1012031212020. Its totient is φ = 1012031212018.
The previous prime is 1012031211991. The next prime is 1012031212109. The reversal of 1012031212019 is 9102121302101.
Together with next prime (1012031212109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (9102121302101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012031212019 is a prime.
It is a super-2 number, since 2×10120312120192 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012031211985 and 1012031212003.
It is not a weakly prime, because it can be changed into another prime (1012031232019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506015606009 + 506015606010.
It is an arithmetic number, because the mean of its divisors is an integer number (506015606010).
Almost surely, 21012031212019 is an apocalyptic number.
1012031212019 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012031212019 is an equidigital number, since it uses as much as digits as its factorization.
1012031212019 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 1012031212019 in words is "one trillion, twelve billion, thirty-one million, two hundred twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •