Base | Representation |
---|---|
bin | 1110101001010001000100… |
… | …1101100110100001001110 |
3 | 2010000100101111202210121000 |
4 | 3222110101031212201032 |
5 | 4102304121004433042 |
6 | 54125113511121130 |
7 | 3251224400445165 |
oct | 352242115464116 |
9 | 63010344683530 |
10 | 16102121171022 |
11 | 514896468a777 |
12 | 19808479731a6 |
13 | 8ca5675b9023 |
14 | 3d94bd97a3dc |
15 | 1cdcbe46074c |
hex | ea51136684e |
16102121171022 has 16 divisors (see below), whose sum is σ = 35782491491280. Its totient is φ = 5367373723656.
The previous prime is 16102121170999. The next prime is 16102121171023. The reversal of 16102121171022 is 22017112120161.
16102121171022 is a `hidden beast` number, since 1 + 610 + 2 + 1 + 2 + 1 + 17 + 10 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16102121171023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149093714493 + ... + 149093714600.
It is an arithmetic number, because the mean of its divisors is an integer number (2236405718205).
Almost surely, 216102121171022 is an apocalyptic number.
16102121171022 is an abundant number, since it is smaller than the sum of its proper divisors (19680370320258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16102121171022 is a wasteful number, since it uses less digits than its factorization.
16102121171022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 298187429104 (or 298187429098 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
Adding to 16102121171022 its reverse (22017112120161), we get a palindrome (38119233291183).
The spelling of 16102121171022 in words is "sixteen trillion, one hundred two billion, one hundred twenty-one million, one hundred seventy-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •