Base | Representation |
---|---|
bin | 100100101110111011110111… |
… | …011011010110110111011000 |
3 | 210012000111211021112112110200 |
4 | 210232323313123112313120 |
5 | 132133404221030000030 |
6 | 1331333211005142200 |
7 | 46012652524624302 |
oct | 4456736733266730 |
9 | 705014737475420 |
10 | 161555051015640 |
11 | 47527126626507 |
12 | 1615254b85a960 |
13 | 6c1b76445baa9 |
14 | 2bc7440286972 |
15 | 13a263e743d60 |
hex | 92eef76d6dd8 |
161555051015640 has 96 divisors (see below), whose sum is σ = 525132843459120. Its totient is φ = 43074870822144.
The previous prime is 161555051015627. The next prime is 161555051015671. The reversal of 161555051015640 is 46510150555161.
161555051015640 is a `hidden beast` number, since 1 + 6 + 1 + 5 + 550 + 5 + 1 + 0 + 1 + 56 + 40 = 666.
It is a super-2 number, since 2×1615550510156402 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31331362 + ... + 36121521.
Almost surely, 2161555051015640 is an apocalyptic number.
161555051015640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
161555051015640 is an abundant number, since it is smaller than the sum of its proper divisors (363577792443480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161555051015640 is a wasteful number, since it uses less digits than its factorization.
161555051015640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67459553 (or 67459546 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 45.
The spelling of 161555051015640 in words is "one hundred sixty-one trillion, five hundred fifty-five billion, fifty-one million, fifteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •