Base | Representation |
---|---|
bin | 11111011111111000… |
… | …10101001111000111 |
3 | 1121122112000222202210 |
4 | 33233330111033013 |
5 | 234113040102020 |
6 | 11434002034503 |
7 | 1136025433014 |
oct | 175774251707 |
9 | 47575028683 |
10 | 16910472135 |
11 | 7198580007 |
12 | 333b348a33 |
13 | 17965a833b |
14 | b65c5670b |
15 | 68e8e03e0 |
hex | 3eff153c7 |
16910472135 has 16 divisors (see below), whose sum is σ = 28648329696. Its totient is φ = 8488393728.
The previous prime is 16910472127. The next prime is 16910472143. The reversal of 16910472135 is 53127401961.
It is an interprime number because it is at equal distance from previous prime (16910472127) and next prime (16910472143).
It is not a de Polignac number, because 16910472135 - 23 = 16910472127 is a prime.
It is a super-2 number, since 2×169104721352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16910472093 and 16910472102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33157534 + ... + 33158043.
It is an arithmetic number, because the mean of its divisors is an integer number (1790520606).
Almost surely, 216910472135 is an apocalyptic number.
16910472135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16910472135 is a deficient number, since it is larger than the sum of its proper divisors (11737857561).
16910472135 is a wasteful number, since it uses less digits than its factorization.
16910472135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66315602.
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 16910472135 in words is "sixteen billion, nine hundred ten million, four hundred seventy-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •