Base | Representation |
---|---|
bin | 100101100001010010101101… |
… | …001111111111000010100000 |
3 | 210122021022222102012012110002 |
4 | 211201102231033333002200 |
5 | 133112103321320123211 |
6 | 1342543032555355132 |
7 | 46520660110214510 |
oct | 4541225517770240 |
9 | 718238872165402 |
10 | 165015550161056 |
11 | 4864077a134a11 |
12 | 16611151a52aa8 |
13 | 710cb905a030a |
14 | 2ca6b1c207840 |
15 | 1412676d2e03b |
hex | 9614ad3ff0a0 |
165015550161056 has 96 divisors (see below), whose sum is σ = 384092985386880. Its totient is φ = 68281395840000.
The previous prime is 165015550161041. The next prime is 165015550161113. The reversal of 165015550161056 is 650161055510561.
It is a self number, because there is not a number n which added to its sum of digits gives 165015550161056.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 752523431 + ... + 752742681.
It is an arithmetic number, because the mean of its divisors is an integer number (4000968597780).
Almost surely, 2165015550161056 is an apocalyptic number.
165015550161056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
165015550161056 is an abundant number, since it is smaller than the sum of its proper divisors (219077435225824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165015550161056 is a wasteful number, since it uses less digits than its factorization.
165015550161056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335158 (or 335150 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 47.
The spelling of 165015550161056 in words is "one hundred sixty-five trillion, fifteen billion, five hundred fifty million, one hundred sixty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •