Base | Representation |
---|---|
bin | 11101011101011010011… |
… | …01000111111010110001 |
3 | 10120202201120112222211021 |
4 | 32232231031013322301 |
5 | 113041013120310413 |
6 | 2053001532215441 |
7 | 133062556231141 |
oct | 16565515077261 |
9 | 3522646488737 |
10 | 1012223213233 |
11 | 360310684a11 |
12 | 14421360a581 |
13 | 745b57544ab |
14 | 36dc596a921 |
15 | 1b4e48c918d |
hex | ebad347eb1 |
1012223213233 has 2 divisors, whose sum is σ = 1012223213234. Its totient is φ = 1012223213232.
The previous prime is 1012223213231. The next prime is 1012223213237. The reversal of 1012223213233 is 3323123222101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 876981679729 + 135241533504 = 936473^2 + 367752^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012223213233 - 21 = 1012223213231 is a prime.
Together with 1012223213231, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1012223213198 and 1012223213207.
It is not a weakly prime, because it can be changed into another prime (1012223213231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506111606616 + 506111606617.
It is an arithmetic number, because the mean of its divisors is an integer number (506111606617).
Almost surely, 21012223213233 is an apocalyptic number.
It is an amenable number.
1012223213233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012223213233 is an equidigital number, since it uses as much as digits as its factorization.
1012223213233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1012223213233 its reverse (3323123222101), we get a palindrome (4335346435334).
The spelling of 1012223213233 in words is "one trillion, twelve billion, two hundred twenty-three million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •