Base | Representation |
---|---|
bin | 10110101111101010001111… |
… | …110000001101010010111100 |
3 | 111010011222121000111020201211 |
4 | 112233222033300031102330 |
5 | 101102411421211244400 |
6 | 552430054110414204 |
7 | 30033042112406656 |
oct | 2657521760152274 |
9 | 433158530436654 |
10 | 100032200103100 |
11 | 29967466140231 |
12 | b276ab1501364 |
13 | 43a7cc42775a5 |
14 | 1a9b8275236d6 |
15 | b87101635dba |
hex | 5afa8fc0d4bc |
100032200103100 has 36 divisors (see below), whose sum is σ = 217200403673344. Its totient is φ = 39988819313280.
The previous prime is 100032200103089. The next prime is 100032200103109. The reversal of 100032200103100 is 1301002230001.
It is a super-2 number, since 2×1000322001031002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100032200103109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 300591969 + ... + 300924568.
Almost surely, 2100032200103100 is an apocalyptic number.
100032200103100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100032200103100 is an abundant number, since it is smaller than the sum of its proper divisors (117168203570244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100032200103100 is a wasteful number, since it uses less digits than its factorization.
100032200103100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601518214 (or 601518207 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 100032200103100 its reverse (1301002230001), we get a palindrome (101333202333101).
The spelling of 100032200103100 in words is "one hundred trillion, thirty-two billion, two hundred million, one hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •