Base | Representation |
---|---|
bin | 11101011101001110000… |
… | …11100001110000011101 |
3 | 10120202110101101221222112 |
4 | 32232213003201300131 |
5 | 113040310212044313 |
6 | 2052543404523405 |
7 | 133060164226052 |
oct | 16564703416035 |
9 | 3522411357875 |
10 | 1012120034333 |
11 | 3602684120a1 |
12 | 1441a4b50565 |
13 | 7459a269aa5 |
14 | 36db5d8d029 |
15 | 1b4da7e78a8 |
hex | eba70e1c1d |
1012120034333 has 2 divisors, whose sum is σ = 1012120034334. Its totient is φ = 1012120034332.
The previous prime is 1012120034311. The next prime is 1012120034357. The reversal of 1012120034333 is 3334300212101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 973651880644 + 38468153689 = 986738^2 + 196133^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012120034333 - 28 = 1012120034077 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1012120034299 and 1012120034308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012120034533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506060017166 + 506060017167.
It is an arithmetic number, because the mean of its divisors is an integer number (506060017167).
Almost surely, 21012120034333 is an apocalyptic number.
It is an amenable number.
1012120034333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012120034333 is an equidigital number, since it uses as much as digits as its factorization.
1012120034333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1012120034333 its reverse (3334300212101), we get a palindrome (4346420246434).
The spelling of 1012120034333 in words is "one trillion, twelve billion, one hundred twenty million, thirty-four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •