Base | Representation |
---|---|
bin | 10101011111010001… |
… | …011000110110010000 |
3 | 2012120000100112120101 |
4 | 111133101120312100 |
5 | 334223221331344 |
6 | 14333311222144 |
7 | 1444530135532 |
oct | 253721306620 |
9 | 65500315511 |
10 | 23073230224 |
11 | 9870267410 |
12 | 457b217954 |
13 | 22392bc065 |
14 | 118c511852 |
15 | 9009779d4 |
hex | 55f458d90 |
23073230224 has 80 divisors (see below), whose sum is σ = 50300994816. Its totient is φ = 10162688000.
The previous prime is 23073230209. The next prime is 23073230227. The reversal of 23073230224 is 42203237032.
It is a junction number, because it is equal to n+sod(n) for n = 23073230192 and 23073230201.
It is not an unprimeable number, because it can be changed into a prime (23073230227) 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, 821664 + ... + 849280.
Almost surely, 223073230224 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 23073230224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25150497408).
23073230224 is an abundant number, since it is smaller than the sum of its proper divisors (27227764592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23073230224 is a wasteful number, since it uses less digits than its factorization.
23073230224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27784 (or 27778 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 28.
Adding to 23073230224 its reverse (42203237032), we get a palindrome (65276467256).
The spelling of 23073230224 in words is "twenty-three billion, seventy-three million, two hundred thirty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •