Base | Representation |
---|---|
bin | 110001011110111010… |
… | …1010110101111010100 |
3 | 101011021201122101010011 |
4 | 1202331311112233110 |
5 | 3220112102030300 |
6 | 120452252210004 |
7 | 10451215624120 |
oct | 1427565265724 |
9 | 334251571104 |
10 | 106264095700 |
11 | 410803479a4 |
12 | 18717769904 |
13 | a036514a49 |
14 | 5200d78580 |
15 | 2b6e13ceba |
hex | 18bdd56bd4 |
106264095700 has 72 divisors (see below), whose sum is σ = 263845390592. Its totient is φ = 36390487680.
The previous prime is 106264095649. The next prime is 106264095709. The reversal of 106264095700 is 7590462601.
It is a super-2 number, since 2×1062640957002 (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 (106264095709) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 508117 + ... + 686083.
Almost surely, 2106264095700 is an apocalyptic number.
106264095700 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 106264095700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131922695296).
106264095700 is an abundant number, since it is smaller than the sum of its proper divisors (157581294892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106264095700 is a wasteful number, since it uses less digits than its factorization.
106264095700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178841 (or 178834 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 106264095700 in words is "one hundred six billion, two hundred sixty-four million, ninety-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •