Base | Representation |
---|---|
bin | 110001100011111110… |
… | …1101101011101110100 |
3 | 101011201120110100200212 |
4 | 1203013331231131310 |
5 | 3220434104324400 |
6 | 120521203124552 |
7 | 10455351365246 |
oct | 1430775553564 |
9 | 334646410625 |
10 | 106434058100 |
11 | 41158284197 |
12 | 18764673758 |
13 | a0627b2c06 |
14 | 521977c096 |
15 | 2b7e012335 |
hex | 18c7f6d774 |
106434058100 has 36 divisors (see below), whose sum is σ = 231476395500. Its totient is φ = 42478786560.
The previous prime is 106434058033. The next prime is 106434058147. The reversal of 106434058100 is 1850434601.
It can be written as a sum of positive squares in 6 ways, for example, as 6430115344 + 100003942756 = 80188^2 + 316234^2 .
It is a super-2 number, since 2×1064340581002 (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 (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1140335 + ... + 1230134.
It is an arithmetic number, because the mean of its divisors is an integer number (6429899875).
Almost surely, 2106434058100 is an apocalyptic number.
106434058100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106434058100 is an abundant number, since it is smaller than the sum of its proper divisors (125042337400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106434058100 is a wasteful number, since it uses less digits than its factorization.
106434058100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2370932 (or 2370925 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 106434058100 in words is "one hundred six billion, four hundred thirty-four million, fifty-eight thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •