Base | Representation |
---|---|
bin | 110000111010111010… |
… | …1001111010000110000 |
3 | 101001011112121010010010 |
4 | 1201311311033100300 |
5 | 3210123330334040 |
6 | 120132340534520 |
7 | 10406250106632 |
oct | 1416565172060 |
9 | 331145533103 |
10 | 105056105520 |
11 | 40610484003 |
12 | 1843b0b1440 |
13 | 9ba3183762 |
14 | 5128768a52 |
15 | 2aed074e80 |
hex | 1875d4f430 |
105056105520 has 80 divisors (see below), whose sum is σ = 329333251680. Its totient is φ = 27700180992.
The previous prime is 105056105507. The next prime is 105056105527. The reversal of 105056105520 is 25501650501.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1050561055202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (105056105527) 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, 2437819 + ... + 2480538.
It is an arithmetic number, because the mean of its divisors is an integer number (4116665646).
Almost surely, 2105056105520 is an apocalyptic number.
105056105520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105056105520 is an abundant number, since it is smaller than the sum of its proper divisors (224277146160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105056105520 is a wasteful number, since it uses less digits than its factorization.
105056105520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4918462 (or 4918456 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 105056105520 in words is "one hundred five billion, fifty-six million, one hundred five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •