Base | Representation |
---|---|
bin | 11110101111000100… |
… | …11000010111100000 |
3 | 1120120222120110120221 |
4 | 33113202120113200 |
5 | 232243230003112 |
6 | 11325214012424 |
7 | 1122624215314 |
oct | 172742302740 |
9 | 46528513527 |
10 | 16501016032 |
11 | 6aa8436636 |
12 | 32461a7114 |
13 | 172c805917 |
14 | b2770db44 |
15 | 6689aee07 |
hex | 3d78985e0 |
16501016032 has 48 divisors (see below), whose sum is σ = 34214019840. Its totient is φ = 7812194688.
The previous prime is 16501016029. The next prime is 16501016033. The reversal of 16501016032 is 23061010561.
16501016032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 16501015988 and 16501016006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16501016033) by changing a digit.
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, 1384563 + ... + 1396429.
It is an arithmetic number, because the mean of its divisors is an integer number (712792080).
Almost surely, 216501016032 is an apocalyptic number.
It is an amenable number.
16501016032 is an abundant number, since it is smaller than the sum of its proper divisors (17713003808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16501016032 is a wasteful number, since it uses less digits than its factorization.
16501016032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14183 (or 14175 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 16501016032 its reverse (23061010561), we get a palindrome (39562026593).
The spelling of 16501016032 in words is "sixteen billion, five hundred one million, sixteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •