Base | Representation |
---|---|
bin | 110000111010111010… |
… | …1001111010000100000 |
3 | 101001011112121010002112 |
4 | 1201311311033100200 |
5 | 3210123330334004 |
6 | 120132340534452 |
7 | 10406250106610 |
oct | 1416565172040 |
9 | 331145533075 |
10 | 105056105504 |
11 | 40610483a99 |
12 | 1843b0b1428 |
13 | 9ba318374c |
14 | 5128768a40 |
15 | 2aed074e6e |
hex | 1875d4f420 |
105056105504 has 72 divisors (see below), whose sum is σ = 251098787520. Its totient is φ = 42375545856.
The previous prime is 105056105477. The next prime is 105056105507. The reversal of 105056105504 is 405501650501.
It is a super-2 number, since 2×1050561055042 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (105056105507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 746684 + ... + 876155.
It is an arithmetic number, because the mean of its divisors is an integer number (3487483160).
Almost surely, 2105056105504 is an apocalyptic number.
105056105504 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
105056105504 is an abundant number, since it is smaller than the sum of its proper divisors (146042682016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105056105504 is a wasteful number, since it uses less digits than its factorization.
105056105504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622890 (or 1622865 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 105056105504 in words is "one hundred five billion, fifty-six million, one hundred five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •