Base | Representation |
---|---|
bin | 10101100111100111… |
… | …011010000010110101 |
3 | 2012220202202202110200 |
4 | 111213213122002311 |
5 | 340020041020041 |
6 | 14355231511113 |
7 | 1451150054205 |
oct | 254747320265 |
9 | 65822682420 |
10 | 23213220021 |
11 | 9932291862 |
12 | 45ba088499 |
13 | 225c2c4864 |
14 | 11a2d52405 |
15 | 90cdcb1b6 |
hex | 5679da0b5 |
23213220021 has 24 divisors (see below), whose sum is σ = 33630168000. Its totient is φ = 15429410496.
The previous prime is 23213219963. The next prime is 23213220077. The reversal of 23213220021 is 12002231232.
23213220021 is a `hidden beast` number, since 2 + 321 + 322 + 0 + 0 + 21 = 666.
It is not a de Polignac number, because 23213220021 - 217 = 23213088949 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23213219976 and 23213220003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23213220221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6433800 + ... + 6437406.
It is an arithmetic number, because the mean of its divisors is an integer number (1401257000).
Almost surely, 223213220021 is an apocalyptic number.
It is an amenable number.
23213220021 is a deficient number, since it is larger than the sum of its proper divisors (10416947979).
23213220021 is a wasteful number, since it uses less digits than its factorization.
23213220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5545 (or 5542 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 23213220021 its reverse (12002231232), we get a palindrome (35215451253).
The spelling of 23213220021 in words is "twenty-three billion, two hundred thirteen million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •