Base | Representation |
---|---|
bin | 1110101001100100100101… |
… | …0100100000100101101010 |
3 | 2010000211220102210111201010 |
4 | 3222121021110200211222 |
5 | 4102400332003120010 |
6 | 54131341243204350 |
7 | 3251501222334120 |
oct | 352311124404552 |
9 | 63024812714633 |
10 | 16107357473130 |
11 | 5150101414a80 |
12 | 19818695166b6 |
13 | 8cabc03a2541 |
14 | 3d985918d910 |
15 | 1cdec8ee2620 |
hex | ea64952096a |
16107357473130 has 64 divisors (see below), whose sum is σ = 48196560549888. Its totient is φ = 3346983370560.
The previous prime is 16107357473041. The next prime is 16107357473131. The reversal of 16107357473130 is 3137475370161.
It is a self number, because there is not a number n which added to its sum of digits gives 16107357473130.
It is not an unprimeable number, because it can be changed into a prime (16107357473131) 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, 3486438702 + ... + 3486443321.
It is an arithmetic number, because the mean of its divisors is an integer number (753071258592).
Almost surely, 216107357473130 is an apocalyptic number.
16107357473130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16107357473130 is an abundant number, since it is smaller than the sum of its proper divisors (32089203076758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16107357473130 is a wasteful number, since it uses less digits than its factorization.
16107357473130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6972882051.
The product of its (nonzero) digits is 1111320, while the sum is 48.
The spelling of 16107357473130 in words is "sixteen trillion, one hundred seven billion, three hundred fifty-seven million, four hundred seventy-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •