Base | Representation |
---|---|
bin | 11001011000100001… |
… | …10100010100011000 |
3 | 1022011201120010121020 |
4 | 30230100310110120 |
5 | 210402120223432 |
6 | 10132124442440 |
7 | 661462623000 |
oct | 145420642430 |
9 | 38151503536 |
10 | 13627507992 |
11 | 58634114aa |
12 | 27839a9420 |
13 | 13923ac1c7 |
14 | 933c33000 |
15 | 54b5a522c |
hex | 32c434518 |
13627507992 has 128 divisors (see below), whose sum is σ = 41012736000. Its totient is φ = 3767904000.
The previous prime is 13627507951. The next prime is 13627508017. The reversal of 13627507992 is 29970572631.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228492 + ... + 281892.
It is an arithmetic number, because the mean of its divisors is an integer number (320412000).
Almost surely, 213627507992 is an apocalyptic number.
13627507992 is a gapful number since it is divisible by the number (12) 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 13627507992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20506368000).
13627507992 is an abundant number, since it is smaller than the sum of its proper divisors (27385228008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13627507992 is a wasteful number, since it uses less digits than its factorization.
13627507992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53462 (or 53444 counting only the distinct ones).
The product of its (nonzero) digits is 1428840, while the sum is 51.
The spelling of 13627507992 in words is "thirteen billion, six hundred twenty-seven million, five hundred seven thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •