Base | Representation |
---|---|
bin | 100100010011101110011… |
… | …0010001010000010110011 |
3 | 122200001110220121121012000 |
4 | 1020213130302022002303 |
5 | 1123224322224312030 |
6 | 14340240504105043 |
7 | 1023345563025330 |
oct | 110473462120263 |
9 | 18601426547160 |
10 | 4990161166515 |
11 | 1654351981318 |
12 | 687162a65183 |
13 | 2a27548b54c5 |
14 | 13374cbb7987 |
15 | 89c13a9b860 |
hex | 489dcc8a0b3 |
4990161166515 has 64 divisors (see below), whose sum is σ = 10139106078720. Its totient is φ = 2281134199680.
The previous prime is 4990161166493. The next prime is 4990161166559. The reversal of 4990161166515 is 5156611610994.
4990161166515 is a `hidden beast` number, since 4 + 9 + 9 + 0 + 1 + 6 + 116 + 6 + 515 = 666.
It is not a de Polignac number, because 4990161166515 - 210 = 4990161165491 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31717945 + ... + 31874885.
It is an arithmetic number, because the mean of its divisors is an integer number (158423532480).
Almost surely, 24990161166515 is an apocalyptic number.
4990161166515 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
4990161166515 is an abundant number, since it is smaller than the sum of its proper divisors (5148944912205).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4990161166515 is a wasteful number, since it uses less digits than its factorization.
4990161166515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190609 (or 190603 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 54.
The spelling of 4990161166515 in words is "four trillion, nine hundred ninety billion, one hundred sixty-one million, one hundred sixty-six thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •