Base | Representation |
---|---|
bin | 1111000011101100000000… |
… | …0000111100011010110010 |
3 | 2011121201222212201100001010 |
4 | 3300323000000330122302 |
5 | 4132223220002303410 |
6 | 55113422202451350 |
7 | 3326063513140221 |
oct | 360730000743262 |
9 | 64551885640033 |
10 | 16556025431730 |
11 | 5303409817a64 |
12 | 1a34803503b56 |
13 | 9312c3807405 |
14 | 41345cbc0cb8 |
15 | 1da9d8361c20 |
hex | f0ec003c6b2 |
16556025431730 has 64 divisors (see below), whose sum is σ = 40508354654208. Its totient is φ = 4329542923200.
The previous prime is 16556025431639. The next prime is 16556025431731. The reversal of 16556025431730 is 3713452065561.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 16556025431730.
It is not an unprimeable number, because it can be changed into a prime (16556025431731) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 18019996 + ... + 18916455.
It is an arithmetic number, because the mean of its divisors is an integer number (632943041472).
Almost surely, 216556025431730 is an apocalyptic number.
16556025431730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16556025431730 is an abundant number, since it is smaller than the sum of its proper divisors (23952329222478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16556025431730 is a wasteful number, since it uses less digits than its factorization.
16556025431730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36936751.
The product of its (nonzero) digits is 2268000, while the sum is 48.
The spelling of 16556025431730 in words is "sixteen trillion, five hundred fifty-six billion, twenty-five million, four hundred thirty-one thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •