Base | Representation |
---|---|
bin | 10101101000001010… |
… | …011011010000100000 |
3 | 2012221102001011002002 |
4 | 111220022123100200 |
5 | 340024413300112 |
6 | 14400200343132 |
7 | 1451321100116 |
oct | 255012332040 |
9 | 65842034062 |
10 | 23222400032 |
11 | 9937491947 |
12 | 4601174aa8 |
13 | 226118a110 |
14 | 11a4261ab6 |
15 | 90dae11c2 |
hex | 56829b420 |
23222400032 has 96 divisors (see below), whose sum is σ = 50027689152. Its totient is φ = 10547057664.
The previous prime is 23222400011. The next prime is 23222400067. The reversal of 23222400032 is 23000422232.
It is a junction number, because it is equal to n+sod(n) for n = 23222399977 and 23222400013.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 6986723 + ... + 6990045.
It is an arithmetic number, because the mean of its divisors is an integer number (521121762).
Almost surely, 223222400032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23222400032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25013844576).
23222400032 is an abundant number, since it is smaller than the sum of its proper divisors (26805289120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23222400032 is a wasteful number, since it uses less digits than its factorization.
23222400032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3610 (or 3602 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 20.
Adding to 23222400032 its reverse (23000422232), we get a palindrome (46222822264).
The spelling of 23222400032 in words is "twenty-three billion, two hundred twenty-two million, four hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •