Base | Representation |
---|---|
bin | 11001011010000101… |
… | …00111010101010000 |
3 | 1022012122010100100000 |
4 | 30231002213111100 |
5 | 210413440441000 |
6 | 10133312330000 |
7 | 662011602222 |
oct | 145502472520 |
9 | 38178110300 |
10 | 13640562000 |
11 | 586a81813a |
12 | 2788243900 |
13 | 1394cccb80 |
14 | 935870412 |
15 | 54c7d3000 |
hex | 32d0a7550 |
13640562000 has 960 divisors, whose sum is σ = 56780365824. Its totient is φ = 3135283200.
The previous prime is 13640561971. The next prime is 13640562011. The reversal of 13640562000 is 26504631.
13640562000 is a `hidden beast` number, since 1 + 36 + 4 + 0 + 5 + 620 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 107405937 + ... + 107406063.
Almost surely, 213640562000 is an apocalyptic number.
13640562000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13640562000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28390182912).
13640562000 is an abundant number, since it is smaller than the sum of its proper divisors (43139803824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13640562000 is a wasteful number, since it uses less digits than its factorization.
13640562000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195 (or 167 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 13640562000 in words is "thirteen billion, six hundred forty million, five hundred sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •