Base | Representation |
---|---|
bin | 1001011000001011111… |
… | …0010011011011101000 |
3 | 120101212010001221201110 |
4 | 2112002332103123220 |
5 | 10114423424114202 |
6 | 202002523150320 |
7 | 14432325161226 |
oct | 2260276233350 |
9 | 511763057643 |
10 | 161111160552 |
11 | 62366060571 |
12 | 272839753a0 |
13 | 12267527484 |
14 | 7b25319b16 |
15 | 42ce2ca26c |
hex | 2582f936e8 |
161111160552 has 64 divisors (see below), whose sum is σ = 405514811520. Its totient is φ = 53339090688.
The previous prime is 161111160533. The next prime is 161111160559. The reversal of 161111160552 is 255061111161.
161111160552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (161111160559) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 10531453 + ... + 10546739.
It is an arithmetic number, because the mean of its divisors is an integer number (6336168930).
Almost surely, 2161111160552 is an apocalyptic number.
161111160552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
161111160552 is an abundant number, since it is smaller than the sum of its proper divisors (244403650968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161111160552 is a wasteful number, since it uses less digits than its factorization.
161111160552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18250 (or 18246 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 30.
The spelling of 161111160552 in words is "one hundred sixty-one billion, one hundred eleven million, one hundred sixty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •