Base | Representation |
---|---|
bin | 1101100001000101100… |
… | …1110001010000100111 |
3 | 211012101211021112111002 |
4 | 3120101121301100213 |
5 | 12301041332431043 |
6 | 254402552503515 |
7 | 22530430102025 |
oct | 3302131612047 |
9 | 735354245432 |
10 | 232220202023 |
11 | 8a536282937 |
12 | 3900a0aab9b |
13 | 18b8a669c84 |
14 | b34d345715 |
15 | 6091e5abb8 |
hex | 3611671427 |
232220202023 has 8 divisors (see below), whose sum is σ = 233326613520. Its totient is φ = 231114971520.
The previous prime is 232220202007. The next prime is 232220202031. The reversal of 232220202023 is 320202022232.
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 232220202023 - 24 = 232220202007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232220201986 and 232220202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232220202923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100208 + ... + 688826.
It is an arithmetic number, because the mean of its divisors is an integer number (29165826690).
Almost surely, 2232220202023 is an apocalyptic number.
232220202023 is a deficient number, since it is larger than the sum of its proper divisors (1106411497).
232220202023 is a wasteful number, since it uses less digits than its factorization.
232220202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590497.
The product of its (nonzero) digits is 1152, while the sum is 20.
Adding to 232220202023 its reverse (320202022232), we get a palindrome (552422224255).
The spelling of 232220202023 in words is "two hundred thirty-two billion, two hundred twenty million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •