Base | Representation |
---|---|
bin | 1100011101011100100000… |
… | …11011010101001111110000 |
3 | 10121000102020110121210021011 |
4 | 12032232100123111033300 |
5 | 12042410214440341300 |
6 | 134135221205040304 |
7 | 5525405011444024 |
oct | 616562033251760 |
9 | 117012213553234 |
10 | 27400019465200 |
11 | 8804312742218 |
12 | 30a63830b6094 |
13 | 1239a702a4565 |
14 | 6aa24d082384 |
15 | 327b0da25eba |
hex | 18eb906d53f0 |
27400019465200 has 60 divisors (see below), whose sum is σ = 66730307750848. Its totient is φ = 10809870681600.
The previous prime is 27400019465191. The next prime is 27400019465213. The reversal of 27400019465200 is 256491000472.
It is a super-3 number, since 3×274000194652003 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 469149216 + ... + 469207615.
Almost surely, 227400019465200 is an apocalyptic number.
27400019465200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27400019465200 is an abundant number, since it is smaller than the sum of its proper divisors (39330288285648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27400019465200 is a wasteful number, since it uses less digits than its factorization.
27400019465200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938356922 (or 938356911 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 27400019465200 in words is "twenty-seven trillion, four hundred billion, nineteen million, four hundred sixty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •