Base | Representation |
---|---|
bin | 10101101000011010… |
… | …101011101001110000 |
3 | 2012221201001122200210 |
4 | 111220122223221300 |
5 | 340032011131423 |
6 | 14400431544120 |
7 | 1451402236152 |
oct | 255032535160 |
9 | 65851048623 |
10 | 23226661488 |
11 | 9939932608 |
12 | 460268b040 |
13 | 226201c9a4 |
14 | 11a4a50ad2 |
15 | 90e183b93 |
hex | 5686aba70 |
23226661488 has 80 divisors (see below), whose sum is σ = 61249758336. Its totient is φ = 7581799680.
The previous prime is 23226661487. The next prime is 23226661529. The reversal of 23226661488 is 88416662232.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23226661487) 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 15 ways as a sum of consecutive naturals, for example, 1383223 + ... + 1399913.
Almost surely, 223226661488 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 23226661488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30624879168).
23226661488 is an abundant number, since it is smaller than the sum of its proper divisors (38023096848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23226661488 is a wasteful number, since it uses less digits than its factorization.
23226661488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17302 (or 17296 counting only the distinct ones).
The product of its digits is 1327104, while the sum is 48.
The spelling of 23226661488 in words is "twenty-three billion, two hundred twenty-six million, six hundred sixty-one thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •