Base | Representation |
---|---|
bin | 110001001000111101… |
… | …1100000111001000000 |
3 | 101002101101122002010002 |
4 | 1202101323200321000 |
5 | 3212110020401030 |
6 | 120251220455132 |
7 | 10424033025464 |
oct | 1422173407100 |
9 | 332341562102 |
10 | 105527512640 |
11 | 40832591170 |
12 | 18550b4a4a8 |
13 | 9c49a37194 |
14 | 51711da4a4 |
15 | 2b29641245 |
hex | 1891ee0e40 |
105527512640 has 112 divisors (see below), whose sum is σ = 274329656064. Its totient is φ = 38345932800.
The previous prime is 105527512633. The next prime is 105527512681. The reversal of 105527512640 is 46215725501.
It is a super-2 number, since 2×1055275126402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105527512594 and 105527512603.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5224160 + ... + 5244320.
Almost surely, 2105527512640 is an apocalyptic number.
105527512640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105527512640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137164828032).
105527512640 is an abundant number, since it is smaller than the sum of its proper divisors (168802143424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105527512640 is a wasteful number, since it uses less digits than its factorization.
105527512640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21676 (or 21666 counting only the distinct ones).
The product of its (nonzero) digits is 84000, while the sum is 38.
The spelling of 105527512640 in words is "one hundred five billion, five hundred twenty-seven million, five hundred twelve thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •