Base | Representation |
---|---|
bin | 10011110110011010… |
… | …111000101011101001 |
3 | 2001000102021002100012 |
4 | 103312122320223221 |
5 | 322122403042413 |
6 | 13442551221305 |
7 | 1353116651621 |
oct | 236632705351 |
9 | 61012232305 |
10 | 21314112233 |
11 | 9048295a97 |
12 | 416a077835 |
13 | 2018a1413b |
14 | 1062a3b881 |
15 | 84b2e77a8 |
hex | 4f66b8ae9 |
21314112233 has 8 divisors (see below), whose sum is σ = 21749154696. Its totient is φ = 20880288000.
The previous prime is 21314112227. The next prime is 21314112241. The reversal of 21314112233 is 33221141312.
It can be written as a sum of positive squares in 4 ways, for example, as 16141194304 + 5172917929 = 127048^2 + 71923^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21314112233 - 216 = 21314046697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21314112199 and 21314112208.
It is not an unprimeable number, because it can be changed into a prime (21314112283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269168 + ... + 339233.
It is an arithmetic number, because the mean of its divisors is an integer number (2718644337).
Almost surely, 221314112233 is an apocalyptic number.
It is an amenable number.
21314112233 is a deficient number, since it is larger than the sum of its proper divisors (435042463).
21314112233 is an equidigital number, since it uses as much as digits as its factorization.
21314112233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 609115.
The product of its digits is 864, while the sum is 23.
Adding to 21314112233 its reverse (33221141312), we get a palindrome (54535253545).
The spelling of 21314112233 in words is "twenty-one billion, three hundred fourteen million, one hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •