Base | Representation |
---|---|
bin | 1111010111011100010100… |
… | …0110101000001010000111 |
3 | 2012211012000101201112020222 |
4 | 3311313011012220022013 |
5 | 4203303301241132241 |
6 | 55533351245014555 |
7 | 3362440042601444 |
oct | 365670506501207 |
9 | 65735011645228 |
10 | 16895413224071 |
11 | 5424339336658 |
12 | 1a8a53b85445b |
13 | 9572cc907305 |
14 | 425a5708a9cb |
15 | 1e474d8c7a4b |
hex | f5dc51a8287 |
16895413224071 has 2 divisors, whose sum is σ = 16895413224072. Its totient is φ = 16895413224070.
The previous prime is 16895413224023. The next prime is 16895413224139. The reversal of 16895413224071 is 17042231459861.
16895413224071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 16895413224071 - 210 = 16895413223047 is a prime.
It is a super-2 number, since 2×168954132240712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16895413224671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8447706612035 + 8447706612036.
It is an arithmetic number, because the mean of its divisors is an integer number (8447706612036).
It is a 1-persistent number, because it is pandigital, but 2⋅16895413224071 = 33790826448142 is not.
Almost surely, 216895413224071 is an apocalyptic number.
16895413224071 is a deficient number, since it is larger than the sum of its proper divisors (1).
16895413224071 is an equidigital number, since it uses as much as digits as its factorization.
16895413224071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 16895413224071 in words is "sixteen trillion, eight hundred ninety-five billion, four hundred thirteen million, two hundred twenty-four thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •