Base | Representation |
---|---|
bin | 110000111110000010… |
… | …1111100101011111100 |
3 | 101001102212020212221001 |
4 | 1201330011330223330 |
5 | 3210332223233210 |
6 | 120151012220044 |
7 | 10411664006443 |
oct | 1417405745374 |
9 | 331385225831 |
10 | 105161149180 |
11 | 406647aa94a |
12 | 1846a30a624 |
13 | 9bbbb71b79 |
14 | 51386add5a |
15 | 2b073c403a |
hex | 187c17cafc |
105161149180 has 48 divisors (see below), whose sum is σ = 222956616960. Its totient is φ = 41662914048.
The previous prime is 105161149139. The next prime is 105161149183. The reversal of 105161149180 is 81941161501.
105161149180 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1051611491802 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105161149183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 818776 + ... + 938464.
It is an arithmetic number, because the mean of its divisors is an integer number (4644929520).
Almost surely, 2105161149180 is an apocalyptic number.
105161149180 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105161149180 is an abundant number, since it is smaller than the sum of its proper divisors (117795467780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105161149180 is a wasteful number, since it uses less digits than its factorization.
105161149180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120118 (or 120116 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 37.
The spelling of 105161149180 in words is "one hundred five billion, one hundred sixty-one million, one hundred forty-nine thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •