Base | Representation |
---|---|
bin | 110001100010101010… |
… | …0101101010010110100 |
3 | 101011121111002112100112 |
4 | 1203011110231102310 |
5 | 3220341234130220 |
6 | 120512541402152 |
7 | 10454302666001 |
oct | 1430524552264 |
9 | 334544075315 |
10 | 106389755060 |
11 | 41135274706 |
12 | 18751869358 |
13 | a0565708b4 |
14 | 52139288a8 |
15 | 2b7a1b05c5 |
hex | 18c552d4b4 |
106389755060 has 24 divisors (see below), whose sum is σ = 223581980160. Its totient is φ = 42524760224.
The previous prime is 106389755051. The next prime is 106389755063. The reversal of 106389755060 is 60557983601.
It is a happy number.
It is a super-2 number, since 2×1063897550602 (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 (106389755063) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1918340 + ... + 1973019.
It is an arithmetic number, because the mean of its divisors is an integer number (9315915840).
Almost surely, 2106389755060 is an apocalyptic number.
106389755060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106389755060 is an abundant number, since it is smaller than the sum of its proper divisors (117192225100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106389755060 is a wasteful number, since it uses less digits than its factorization.
106389755060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3892735 (or 3892733 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 106389755060 in words is "one hundred six billion, three hundred eighty-nine million, seven hundred fifty-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •