Base | Representation |
---|---|
bin | 1110101001010011001011… |
… | …1010001110110100100001 |
3 | 2010000101211220120102121202 |
4 | 3222110302322032310201 |
5 | 4102311300222043221 |
6 | 54125245544330545 |
7 | 3251244404020556 |
oct | 352246272166441 |
9 | 63011756512552 |
10 | 16102686518561 |
11 | 514912481a745 |
12 | 1980985173a55 |
13 | 8ca6277710b6 |
14 | 3d9534aa2a2d |
15 | 1cdd03dd5d0b |
hex | ea532e8ed21 |
16102686518561 has 16 divisors (see below), whose sum is σ = 17529097341888. Its totient is φ = 14732860262400.
The previous prime is 16102686518557. The next prime is 16102686518603. The reversal of 16102686518561 is 16581568620161.
16102686518561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 16102686518561 - 22 = 16102686518557 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16102686518497 and 16102686518506.
It is not an unprimeable number, because it can be changed into a prime (16102686518461) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52045520 + ... + 52354001.
It is an arithmetic number, because the mean of its divisors is an integer number (1095568583868).
Almost surely, 216102686518561 is an apocalyptic number.
It is an amenable number.
16102686518561 is a deficient number, since it is larger than the sum of its proper divisors (1426410823327).
16102686518561 is a wasteful number, since it uses less digits than its factorization.
16102686518561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104399792.
The product of its (nonzero) digits is 4147200, while the sum is 56.
The spelling of 16102686518561 in words is "sixteen trillion, one hundred two billion, six hundred eighty-six million, five hundred eighteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •