Base | Representation |
---|---|
bin | 11111011100110111… |
… | …00010111110100101 |
3 | 1121120202021222100212 |
4 | 33232123202332211 |
5 | 234040041203303 |
6 | 11431254145205 |
7 | 1135266662054 |
oct | 175633427645 |
9 | 47522258325 |
10 | 16885100453 |
11 | 7185220981 |
12 | 3332952205 |
13 | 1791263c00 |
14 | b6273039b |
15 | 68c57cad8 |
hex | 3ee6e2fa5 |
16885100453 has 18 divisors (see below), whose sum is σ = 18642422646. Its totient is φ = 15281028672.
The previous prime is 16885100369. The next prime is 16885100461. The reversal of 16885100453 is 35400158861.
It can be written as a sum of positive squares in 9 ways, for example, as 1216609 + 16883883844 = 1103^2 + 129938^2 .
It is not a de Polignac number, because 16885100453 - 212 = 16885096357 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16885100453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16885100473) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 12297275 + ... + 12298647.
It is an arithmetic number, because the mean of its divisors is an integer number (1035690147).
Almost surely, 216885100453 is an apocalyptic number.
16885100453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16885100453 is a deficient number, since it is larger than the sum of its proper divisors (1757322193).
16885100453 is an frugal number, since it uses more digits than its factorization.
16885100453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2825 (or 1439 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 16885100453 in words is "sixteen billion, eight hundred eighty-five million, one hundred thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •