Base | Representation |
---|---|
bin | 11110111001101101… |
… | …01001011110001100 |
3 | 1120211012102020122100 |
4 | 33130312221132030 |
5 | 232434043340202 |
6 | 11342121515100 |
7 | 1125056333625 |
oct | 173466513614 |
9 | 46735366570 |
10 | 16590215052 |
11 | 7043820134 |
12 | 3270042a90 |
13 | 17451370c8 |
14 | b354cca4c |
15 | 67172e41c |
hex | 3dcda978c |
16590215052 has 18 divisors (see below), whose sum is σ = 41936377028. Its totient is φ = 5530071672.
The previous prime is 16590214999. The next prime is 16590215063. The reversal of 16590215052 is 25051209561.
16590215052 is a `hidden beast` number, since 1 + 6 + 590 + 2 + 15 + 0 + 52 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 460839307 = 16590215052 / (1 + 6 + 5 + 9 + 0 + 2 + 1 + 5 + 0 + 5 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 16590214998 and 16590215016.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 230419618 + ... + 230419689.
Almost surely, 216590215052 is an apocalyptic number.
16590215052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16590215052 is an abundant number, since it is smaller than the sum of its proper divisors (25346161976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16590215052 is a wasteful number, since it uses less digits than its factorization.
16590215052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460839317 (or 460839312 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 16590215052 in words is "sixteen billion, five hundred ninety million, two hundred fifteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •