Base | Representation |
---|---|
bin | 110001100011001010… |
… | …1100100111001010100 |
3 | 101011122200002110202212 |
4 | 1203012111210321110 |
5 | 3220410112310040 |
6 | 120514350052552 |
7 | 10454600352101 |
oct | 1430625447124 |
9 | 334580073685 |
10 | 106406760020 |
11 | 411439297a0 |
12 | 187574aa158 |
13 | a059c459c2 |
14 | 5215cb3aa8 |
15 | 2b7b91dd65 |
hex | 18c6564e54 |
106406760020 has 48 divisors (see below), whose sum is σ = 246134947968. Its totient is φ = 38317695360.
The previous prime is 106406760017. The next prime is 106406760037. The reversal of 106406760020 is 20067604601.
106406760020 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1064067600202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 2325239 + ... + 2370558.
It is an arithmetic number, because the mean of its divisors is an integer number (5127811416).
Almost surely, 2106406760020 is an apocalyptic number.
106406760020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106406760020 is an abundant number, since it is smaller than the sum of its proper divisors (139728187948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106406760020 is a wasteful number, since it uses less digits than its factorization.
106406760020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4695920 (or 4695918 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 32.
The spelling of 106406760020 in words is "one hundred six billion, four hundred six million, seven hundred sixty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •