Base | Representation |
---|---|
bin | 1110101100001101110100… |
… | …1000011101110001101001 |
3 | 2010012012011111111102220221 |
4 | 3223003131020131301221 |
5 | 4104121401434014214 |
6 | 54204253220050041 |
7 | 3255000056152252 |
oct | 353033510356151 |
9 | 63165144442827 |
10 | 16152787016809 |
11 | 51683a41945a3 |
12 | 198a627833921 |
13 | 90228029a331 |
14 | 3dbb288b3b29 |
15 | 1d02874cce24 |
hex | eb0dd21dc69 |
16152787016809 has 9 divisors (see below), whose sum is σ = 16206146297149. Its totient is φ = 16099602888460.
The previous prime is 16152787016797. The next prime is 16152787016857. The reversal of 16152787016809 is 90861078725161.
The square root of 16152787016809 is 4019053.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 16152787016809 - 217 = 16152786885737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16152787016869) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 1249919022 + ... + 1249931944.
Almost surely, 216152787016809 is an apocalyptic number.
16152787016809 is the 4019053-rd square number.
16152787016809 is the 2009527-th centered octagonal number.
It is an amenable number.
16152787016809 is a deficient number, since it is larger than the sum of its proper divisors (53359280340).
16152787016809 is an frugal number, since it uses more digits than its factorization.
16152787016809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26468 (or 13234 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 61.
The spelling of 16152787016809 in words is "sixteen trillion, one hundred fifty-two billion, seven hundred eighty-seven million, sixteen thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •