Base | Representation |
---|---|
bin | 11110101100000101… |
… | …00101000011111001 |
3 | 1120112020022112220001 |
4 | 33112002211003321 |
5 | 232220312332301 |
6 | 11322515433001 |
7 | 1122200600203 |
oct | 172602450371 |
9 | 46466275801 |
10 | 16475902201 |
11 | 6a95243200 |
12 | 32398b5761 |
13 | 1727551975 |
14 | b24253773 |
15 | 66669dc01 |
hex | 3d60a50f9 |
16475902201 has 12 divisors (see below), whose sum is σ = 18113944576. Its totient is φ = 14974728120.
The previous prime is 16475902169. The next prime is 16475902213. The reversal of 16475902201 is 10220957461.
16475902201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16475902201 - 25 = 16475902169 is a prime.
It is a hoax number, since the sum of its digits (37) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16475902601) 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 11 ways as a sum of consecutive naturals, for example, 641656 + ... + 666838.
Almost surely, 216475902201 is an apocalyptic number.
16475902201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16475902201 is a deficient number, since it is larger than the sum of its proper divisors (1638042375).
16475902201 is a wasteful number, since it uses less digits than its factorization.
16475902201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30612 (or 30601 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 16475902201 in words is "sixteen billion, four hundred seventy-five million, nine hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •