Base | Representation |
---|---|
bin | 110001001000010010… |
… | …1111101101001100010 |
3 | 101002022211102200121122 |
4 | 1202100211331221202 |
5 | 3212033300223200 |
6 | 120245100052242 |
7 | 10423341302030 |
oct | 1422045755142 |
9 | 332284380548 |
10 | 105505086050 |
11 | 408209637a1 |
12 | 18545534082 |
13 | 9c451b4400 |
14 | 516c23d550 |
15 | 2b276b1385 |
hex | 189097da62 |
105505086050 has 144 divisors (see below), whose sum is σ = 243229557312. Its totient is φ = 33338822400.
The previous prime is 105505086047. The next prime is 105505086083. The reversal of 105505086050 is 50680505501.
It is a super-2 number, since 2×1055050860502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 105505086050.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 60391277 + ... + 60393023.
It is an arithmetic number, because the mean of its divisors is an integer number (1689094148).
Almost surely, 2105505086050 is an apocalyptic number.
105505086050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105505086050 is an abundant number, since it is smaller than the sum of its proper divisors (137724471262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105505086050 is a wasteful number, since it uses less digits than its factorization.
105505086050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2813 (or 2795 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 105505086050 in words is "one hundred five billion, five hundred five million, eighty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •