Base | Representation |
---|---|
bin | 10110000010010100… |
… | …101110111110101110 |
3 | 2021001222221002012000 |
4 | 112002110232332232 |
5 | 341424243403440 |
6 | 14511515553130 |
7 | 1465230546462 |
oct | 260224567656 |
9 | 67058832160 |
10 | 23661309870 |
11 | a042213350 |
12 | 470415b7a6 |
13 | 23010a2c93 |
14 | 12066744a2 |
15 | 9373dd730 |
hex | 58252efae |
23661309870 has 128 divisors (see below), whose sum is σ = 68961300480. Its totient is φ = 5725376640.
The previous prime is 23661309851. The next prime is 23661309887. The reversal of 23661309870 is 7890316632.
23661309870 is a `hidden beast` number, since 2 + 366 + 130 + 98 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 1647139 + ... + 1661441.
It is an arithmetic number, because the mean of its divisors is an integer number (538760160).
Almost surely, 223661309870 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23661309870, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34480650240).
23661309870 is an abundant number, since it is smaller than the sum of its proper divisors (45299990610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23661309870 is a wasteful number, since it uses less digits than its factorization.
23661309870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14887 (or 14881 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 45.
The spelling of 23661309870 in words is "twenty-three billion, six hundred sixty-one million, three hundred nine thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •