Base | Representation |
---|---|
bin | 11110001011101011… |
… | …00011001010111010 |
3 | 1112211021210002022212 |
4 | 33011311203022322 |
5 | 231141214114010 |
6 | 11235525015122 |
7 | 1112360106401 |
oct | 170565431272 |
9 | 45737702285 |
10 | 16204051130 |
11 | 69658454a3 |
12 | 31828544a2 |
13 | 16b312b447 |
14 | ada0ca638 |
15 | 64c8a0505 |
hex | 3c5d632ba |
16204051130 has 16 divisors (see below), whose sum is σ = 29176035840. Its totient is φ = 6479677392.
The previous prime is 16204051121. The next prime is 16204051153. The reversal of 16204051130 is 3115040261.
It is a super-3 number, since 3×162040511303 (a number of 32 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16204051096 and 16204051105.
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 7 ways as a sum of consecutive naturals, for example, 207614 + ... + 274793.
It is an arithmetic number, because the mean of its divisors is an integer number (1823502240).
Almost surely, 216204051130 is an apocalyptic number.
16204051130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16204051130 is a deficient number, since it is larger than the sum of its proper divisors (12971984710).
16204051130 is a wasteful number, since it uses less digits than its factorization.
16204051130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485773.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 16204051130 its reverse (3115040261), we get a palindrome (19319091391).
The spelling of 16204051130 in words is "sixteen billion, two hundred four million, fifty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •