Base | Representation |
---|---|
bin | 11110000010101010011… |
… | …11101000101100001111 |
3 | 10122200100100101112111121 |
4 | 33001111033220230033 |
5 | 113402442403010411 |
6 | 2110110230301411 |
7 | 134401300616134 |
oct | 17012517505417 |
9 | 3580310345447 |
10 | 1032222313231 |
11 | 36884364982a |
12 | 1480751b7867 |
13 | 76451ba5585 |
14 | 37d61a9a58b |
15 | 1bcb5518571 |
hex | f0553e8b0f |
1032222313231 has 2 divisors, whose sum is σ = 1032222313232. Its totient is φ = 1032222313230.
The previous prime is 1032222313223. The next prime is 1032222313267. The reversal of 1032222313231 is 1323132222301.
It is a weak prime.
It is an emirp because it is prime and its reverse (1323132222301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1032222313231 - 23 = 1032222313223 is a prime.
It is a super-2 number, since 2×10322223132312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1032222313196 and 1032222313205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032222313831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516111156615 + 516111156616.
It is an arithmetic number, because the mean of its divisors is an integer number (516111156616).
Almost surely, 21032222313231 is an apocalyptic number.
1032222313231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032222313231 is an equidigital number, since it uses as much as digits as its factorization.
1032222313231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1032222313231 its reverse (1323132222301), we get a palindrome (2355354535532).
The spelling of 1032222313231 in words is "one trillion, thirty-two billion, two hundred twenty-two million, three hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •