Base | Representation |
---|---|
bin | 10101011111001011… |
… | …001011010000000110 |
3 | 2012112220021210121120 |
4 | 111133023023100012 |
5 | 334222312223140 |
6 | 14333212254410 |
7 | 1444510243545 |
oct | 253713132006 |
9 | 65486253546 |
10 | 23071601670 |
11 | 986a3548a7 |
12 | 457a771406 |
13 | 2238b6ba10 |
14 | 118c20a15c |
15 | 9007551d0 |
hex | 55f2cb406 |
23071601670 has 64 divisors (see below), whose sum is σ = 59784903360. Its totient is φ = 5664526848.
The previous prime is 23071601669. The next prime is 23071601671. The reversal of 23071601670 is 7610617032.
It is an interprime number because it is at equal distance from previous prime (23071601669) and next prime (23071601671).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23071601671) 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 31 ways as a sum of consecutive naturals, for example, 75672 + ... + 227748.
It is an arithmetic number, because the mean of its divisors is an integer number (934139115).
Almost surely, 223071601670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23071601670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29892451680).
23071601670 is an abundant number, since it is smaller than the sum of its proper divisors (36713301690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23071601670 is a wasteful number, since it uses less digits than its factorization.
23071601670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152489.
The product of its (nonzero) digits is 10584, while the sum is 33.
The spelling of 23071601670 in words is "twenty-three billion, seventy-one million, six hundred one thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •