Base | Representation |
---|---|
bin | 1010110000101000111110… |
… | …10111101000000010000000 |
3 | 10002210000110200210110202001 |
4 | 11120110133113220002000 |
5 | 11100132223241330030 |
6 | 122153535450233344 |
7 | 4661326025024515 |
oct | 530243727500200 |
9 | 102700420713661 |
10 | 23661501120640 |
11 | 75a287158a539 |
12 | 27a1910a25854 |
13 | 10283681c3686 |
14 | 5bb3193a330c |
15 | 2b0753866cca |
hex | 15851f5e8080 |
23661501120640 has 32 divisors (see below), whose sum is σ = 56565776118060. Its totient is φ = 9464600448000.
The previous prime is 23661501120577. The next prime is 23661501120667. The reversal of 23661501120640 is 4602110516632.
It can be written as a sum of positive squares in 2 ways, for example, as 23565743055936 + 95758064704 = 4854456^2 + 309448^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 23661501120640.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18485547111 + ... + 18485548390.
Almost surely, 223661501120640 is an apocalyptic number.
23661501120640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23661501120640 is an abundant number, since it is smaller than the sum of its proper divisors (32904274997420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23661501120640 is an equidigital number, since it uses as much as digits as its factorization.
23661501120640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36971095520 (or 36971095508 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 23661501120640 in words is "twenty-three trillion, six hundred sixty-one billion, five hundred one million, one hundred twenty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •