Base | Representation |
---|---|
bin | 10110110111111011010100… |
… | …000001001000110101010110 |
3 | 111012012021220120001200020020 |
4 | 112313323110001020311112 |
5 | 101141213333423400110 |
6 | 553543044153250010 |
7 | 30122062514116062 |
oct | 2667732401106526 |
9 | 435167816050206 |
10 | 100600281075030 |
11 | 2a066381028590 |
12 | b349012703906 |
13 | 44197480a6229 |
14 | 1abb118540aa2 |
15 | b96c9e15dd70 |
hex | 5b7ed4048d56 |
100600281075030 has 64 divisors (see below), whose sum is σ = 265947009689088. Its totient is φ = 24151170735360.
The previous prime is 100600281074987. The next prime is 100600281075031. The reversal of 100600281075030 is 30570182006001.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 100600281074982 and 100600281075000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100600281075031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1479817159 + ... + 1479885138.
It is an arithmetic number, because the mean of its divisors is an integer number (4155422026392).
Almost surely, 2100600281075030 is an apocalyptic number.
100600281075030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100600281075030 is an abundant number, since it is smaller than the sum of its proper divisors (165346728614058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100600281075030 is a wasteful number, since it uses less digits than its factorization.
100600281075030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2959702421.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 100600281075030 in words is "one hundred trillion, six hundred billion, two hundred eighty-one million, seventy-five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •