Base | Representation |
---|---|
bin | 11110001101100101… |
… | …00000111001110001 |
3 | 1112212101212000211002 |
4 | 33012302200321301 |
5 | 231204312021000 |
6 | 11241255331345 |
7 | 1112643000566 |
oct | 170662407161 |
9 | 45771760732 |
10 | 16220032625 |
11 | 6973870645 |
12 | 3188080b55 |
13 | 16b6535754 |
14 | adc28a86d |
15 | 64deaa8d5 |
hex | 3c6ca0e71 |
16220032625 has 8 divisors (see below), whose sum is σ = 20242600872. Its totient is φ = 12976026000.
The previous prime is 16220032547. The next prime is 16220032637. The reversal of 16220032625 is 52623002261.
16220032625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 458987776 + 15761044849 = 21424^2 + 125543^2 .
It is not a de Polignac number, because 16220032625 - 210 = 16220031601 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64880006 + ... + 64880255.
It is an arithmetic number, because the mean of its divisors is an integer number (2530325109).
Almost surely, 216220032625 is an apocalyptic number.
It is an amenable number.
16220032625 is a deficient number, since it is larger than the sum of its proper divisors (4022568247).
16220032625 is an equidigital number, since it uses as much as digits as its factorization.
16220032625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129760276 (or 129760266 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 16220032625 its reverse (52623002261), we get a palindrome (68843034886).
The spelling of 16220032625 in words is "sixteen billion, two hundred twenty million, thirty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •