Base | Representation |
---|---|
bin | 11001010111010001… |
… | …100010011110000000 |
3 | 2121021222121112000210 |
4 | 121113101202132000 |
5 | 421233402103300 |
6 | 20302223314120 |
7 | 1652612225613 |
oct | 312721423600 |
9 | 77258545023 |
10 | 27234019200 |
11 | 10605991793 |
12 | 534074b940 |
13 | 275031937b |
14 | 1464d5c17a |
15 | a95dae050 |
hex | 657462780 |
27234019200 has 192 divisors, whose sum is σ = 89866569600. Its totient is φ = 7249090560.
The previous prime is 27234019181. The next prime is 27234019217. The reversal of 27234019200 is 291043272.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5940109 + ... + 5944691.
It is an arithmetic number, because the mean of its divisors is an integer number (468055050).
Almost surely, 227234019200 is an apocalyptic number.
27234019200 is a gapful number since it is divisible by the number (20) 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 27234019200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44933284800).
27234019200 is an abundant number, since it is smaller than the sum of its proper divisors (62632550400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27234019200 is a wasteful number, since it uses less digits than its factorization.
27234019200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5229 (or 5212 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The spelling of 27234019200 in words is "twenty-seven billion, two hundred thirty-four million, nineteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •