Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …110110011001000001101000 |
3 | 111010002221220101112011212200 |
4 | 112233112200312121001220 |
5 | 101102040023044201300 |
6 | 552412231422140200 |
7 | 30031362053352525 |
oct | 2657264066310150 |
9 | 433087811464780 |
10 | 100011012100200 |
11 | 2995948305a033 |
12 | b272979721660 |
13 | 43a5cc8719076 |
14 | 1a9a7b755214c |
15 | b867b144e200 |
hex | 5af5a0d99068 |
100011012100200 has 144 divisors (see below), whose sum is σ = 336707899901100. Its totient is φ = 26603095296000.
The previous prime is 100011012100171. The next prime is 100011012100217. The reversal of 100011012100200 is 2001210110001.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 55958508613764 + 44052503486436 = 7480542^2 + 6637206^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 68557095 + ... + 70000694.
Almost surely, 2100011012100200 is an apocalyptic number.
100011012100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100011012100200 is an abundant number, since it is smaller than the sum of its proper divisors (236696887800900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011012100200 is a wasteful number, since it uses less digits than its factorization.
100011012100200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138558212 (or 138558200 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100011012100200 its reverse (2001210110001), we get a palindrome (102012222210201).
The spelling of 100011012100200 in words is "one hundred trillion, eleven billion, twelve million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •