Base | Representation |
---|---|
bin | 10101101000100111… |
… | …011101001101101100 |
3 | 2012221221100210021220 |
4 | 111220213131031230 |
5 | 340033340311340 |
6 | 14401031423340 |
7 | 1451442554214 |
oct | 255047351554 |
9 | 65857323256 |
10 | 23230010220 |
11 | 994080a55a |
12 | 4603824b50 |
13 | 2262922ca1 |
14 | 11a5283244 |
15 | 90e5e5ed0 |
hex | 5689dd36c |
23230010220 has 24 divisors (see below), whose sum is σ = 65044028784. Its totient is φ = 6194669376.
The previous prime is 23230010207. The next prime is 23230010231. The reversal of 23230010220 is 2201003232.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 23230010220.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 193583359 + ... + 193583478.
It is an arithmetic number, because the mean of its divisors is an integer number (2710167866).
Almost surely, 223230010220 is an apocalyptic number.
23230010220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23230010220 is an abundant number, since it is smaller than the sum of its proper divisors (41814018564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23230010220 is a wasteful number, since it uses less digits than its factorization.
23230010220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387166849 (or 387166847 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 23230010220 its reverse (2201003232), we get a palindrome (25431013452).
The spelling of 23230010220 in words is "twenty-three billion, two hundred thirty million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •