Base | Representation |
---|---|
bin | 1110100101000110001010… |
… | …0011101100100010010100 |
3 | 2002202111110010020000212210 |
4 | 3221101202203230202110 |
5 | 4100120401144121200 |
6 | 54032144045313420 |
7 | 3243110012200164 |
oct | 351214243544224 |
9 | 62674403200783 |
10 | 16030471473300 |
11 | 5120537262359 |
12 | 196a990565870 |
13 | 8c3889457c9b |
14 | 3d5c43c145a4 |
15 | 1cbec90d5650 |
hex | e94628ec894 |
16030471473300 has 36 divisors (see below), whose sum is σ = 46381497463616. Its totient is φ = 4274792392800.
The previous prime is 16030471473257. The next prime is 16030471473311. The reversal of 16030471473300 is 337417403061.
It is a super-2 number, since 2×160304714733002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26717452156 + ... + 26717452755.
Almost surely, 216030471473300 is an apocalyptic number.
16030471473300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16030471473300 is an abundant number, since it is smaller than the sum of its proper divisors (30351025990316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16030471473300 is a wasteful number, since it uses less digits than its factorization.
16030471473300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53434904928 (or 53434904921 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 39.
Adding to 16030471473300 its reverse (337417403061), we get a palindrome (16367888876361).
The spelling of 16030471473300 in words is "sixteen trillion, thirty billion, four hundred seventy-one million, four hundred seventy-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •