Base | Representation |
---|---|
bin | 100000010101101100110… |
… | …010010111111100101001 |
3 | 21212110012112020110021001 |
4 | 200111230302113330221 |
5 | 242402304222033044 |
6 | 4420530551315001 |
7 | 316362145556455 |
oct | 40255462277451 |
9 | 7773175213231 |
10 | 2222323236649 |
11 | 78753359309a |
12 | 2ba84b67ba61 |
13 | 13174467a9c9 |
14 | 797bd613665 |
15 | 3cc1b12e2d4 |
hex | 2056cc97f29 |
2222323236649 has 2 divisors, whose sum is σ = 2222323236650. Its totient is φ = 2222323236648.
The previous prime is 2222323236557. The next prime is 2222323236673. The reversal of 2222323236649 is 9466323232222.
2222323236649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2044808481024 + 177514755625 = 1429968^2 + 421325^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222323236649 - 231 = 2220175753001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2222323236599 and 2222323236608.
It is not a weakly prime, because it can be changed into another prime (2222323236689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111161618324 + 1111161618325.
It is an arithmetic number, because the mean of its divisors is an integer number (1111161618325).
Almost surely, 22222323236649 is an apocalyptic number.
It is an amenable number.
2222323236649 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222323236649 is an equidigital number, since it uses as much as digits as its factorization.
2222323236649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488, while the sum is 46.
The spelling of 2222323236649 in words is "two trillion, two hundred twenty-two billion, three hundred twenty-three million, two hundred thirty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •