Base | Representation |
---|---|
bin | 110001100111100110… |
… | …1001101001000110100 |
3 | 101012001001002022122202 |
4 | 1203033031031020310 |
5 | 3221211210414000 |
6 | 120541223244032 |
7 | 10461355214534 |
oct | 1431715151064 |
9 | 335031068582 |
10 | 106555560500 |
11 | 4120a9217a4 |
12 | 187992a9618 |
13 | a081a1491c |
14 | 522b9694c4 |
15 | 2b89a12dd5 |
hex | 18cf34d234 |
106555560500 has 96 divisors (see below), whose sum is σ = 236601001728. Its totient is φ = 41913168000.
The previous prime is 106555560497. The next prime is 106555560541. The reversal of 106555560500 is 5065555601.
It is a super-2 number, since 2×1065555605002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21873065 + ... + 21877935.
It is an arithmetic number, because the mean of its divisors is an integer number (2464593768).
Almost surely, 2106555560500 is an apocalyptic number.
106555560500 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 106555560500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118300500864).
106555560500 is an abundant number, since it is smaller than the sum of its proper divisors (130045441228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106555560500 is a wasteful number, since it uses less digits than its factorization.
106555560500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5610 (or 5598 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 106555560500 in words is "one hundred six billion, five hundred fifty-five million, five hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •