Base | Representation |
---|---|
bin | 10110000001001100… |
… | …111011011110001110 |
3 | 2021000200111202121110 |
4 | 112001030323132032 |
5 | 341404434033140 |
6 | 14510004312450 |
7 | 1464611551365 |
oct | 260114733616 |
9 | 67020452543 |
10 | 23642486670 |
11 | a032627190 |
12 | 46b99a2726 |
13 | 22ca2123aa |
14 | 1203d747dc |
15 | 935921380 |
hex | 58133b78e |
23642486670 has 128 divisors (see below), whose sum is σ = 66465764352. Its totient is φ = 5318297600.
The previous prime is 23642486663. The next prime is 23642486677. The reversal of 23642486670 is 7668424632.
It is an interprime number because it is at equal distance from previous prime (23642486663) and next prime (23642486677).
It is a super-2 number, since 2×236424866702 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23642486677) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 368632 + ... + 427988.
It is an arithmetic number, because the mean of its divisors is an integer number (519263784).
Almost surely, 223642486670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23642486670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33232882176).
23642486670 is an abundant number, since it is smaller than the sum of its proper divisors (42823277682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23642486670 is a wasteful number, since it uses less digits than its factorization.
23642486670 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59466.
The product of its (nonzero) digits is 2322432, while the sum is 48.
The spelling of 23642486670 in words is "twenty-three billion, six hundred forty-two million, four hundred eighty-six thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •