Base | Representation |
---|---|
bin | 1000010001010100… |
… | …0011000110010111 |
3 | 12201201112021200212 |
4 | 2010111003012113 |
5 | 14021322011411 |
6 | 1004144400035 |
7 | 106005424403 |
oct | 20425030627 |
9 | 5651467625 |
10 | 2220110231 |
11 | a3a215749 |
12 | 51b61601b |
13 | 294c52cc1 |
14 | 170bd4103 |
15 | ced9068b |
hex | 84543197 |
2220110231 has 2 divisors, whose sum is σ = 2220110232. Its totient is φ = 2220110230.
The previous prime is 2220110203. The next prime is 2220110303. The reversal of 2220110231 is 1320110222.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220110231 - 222 = 2215915927 is a prime.
It is a super-2 number, since 2×22201102312 = 9857778875581746722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220110731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110055115 + 1110055116.
It is an arithmetic number, because the mean of its divisors is an integer number (1110055116).
Almost surely, 22220110231 is an apocalyptic number.
2220110231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220110231 is an equidigital number, since it uses as much as digits as its factorization.
2220110231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2220110231 is about 47118.0457043795. The cubic root of 2220110231 is about 1304.5423410485.
Adding to 2220110231 its reverse (1320110222), we get a palindrome (3540220453).
Subtracting from 2220110231 its reverse (1320110222), we obtain a palindrome (900000009).
The spelling of 2220110231 in words is "two billion, two hundred twenty million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •