Base | Representation |
---|---|
bin | 110000111001100011… |
… | …1011111110001101100 |
3 | 101001001100220011120000 |
4 | 1201303013133301230 |
5 | 3210030200410413 |
6 | 120124032424300 |
7 | 10405155014316 |
oct | 1416307376154 |
9 | 331040804500 |
10 | 105010560108 |
11 | 405977a6073 |
12 | 184279a8090 |
13 | 9b968c7acc |
14 | 51226b07b6 |
15 | 2ae907a073 |
hex | 18731dfc6c |
105010560108 has 60 divisors (see below), whose sum is σ = 276680017152. Its totient is φ = 34727888160.
The previous prime is 105010560101. The next prime is 105010560169. The reversal of 105010560108 is 801065010501.
105010560108 is a `hidden beast` number, since 1 + 0 + 50 + 1 + 0 + 5 + 601 + 0 + 8 = 666.
It is a super-2 number, since 2×1050105601082 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (105010560101) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1234863 + ... + 1317158.
Almost surely, 2105010560108 is an apocalyptic number.
105010560108 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
105010560108 is an abundant number, since it is smaller than the sum of its proper divisors (171669457044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105010560108 is a wasteful number, since it uses less digits than its factorization.
105010560108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2552164 (or 2552153 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
Adding to 105010560108 its reverse (801065010501), we get a palindrome (906075570609).
The spelling of 105010560108 in words is "one hundred five billion, ten million, five hundred sixty thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •