Base | Representation |
---|---|
bin | 110000111010111010… |
… | …1001111010000011100 |
3 | 101001011112121010002101 |
4 | 1201311311033100130 |
5 | 3210123330334000 |
6 | 120132340534444 |
7 | 10406250106603 |
oct | 1416565172034 |
9 | 331145533071 |
10 | 105056105500 |
11 | 40610483a95 |
12 | 1843b0b1424 |
13 | 9ba3183748 |
14 | 5128768a3a |
15 | 2aed074e6a |
hex | 1875d4f41c |
105056105500 has 24 divisors (see below), whose sum is σ = 229442535504. Its totient is φ = 42022442000.
The previous prime is 105056105477. The next prime is 105056105507. The reversal of 105056105500 is 5501650501.
It is a super-2 number, since 2×1050561055002 (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 (105056105507) 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 7 ways as a sum of consecutive naturals, for example, 105055606 + ... + 105056605.
It is an arithmetic number, because the mean of its divisors is an integer number (9560105646).
Almost surely, 2105056105500 is an apocalyptic number.
105056105500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105056105500 is an abundant number, since it is smaller than the sum of its proper divisors (124386430004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105056105500 is a wasteful number, since it uses less digits than its factorization.
105056105500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210112230 (or 210112218 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 105056105500 in words is "one hundred five billion, fifty-six million, one hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •