Base | Representation |
---|---|
bin | 10110110000101010100001… |
… | …110010010001001110010100 |
3 | 111010102120202021120111102110 |
4 | 112300222201302101032110 |
5 | 101110024300330010400 |
6 | 552521511103511020 |
7 | 30041034412654041 |
oct | 2660524162211624 |
9 | 433376667514373 |
10 | 100101222110100 |
11 | 2999376527a722 |
12 | b2883548b8470 |
13 | 43b1673bbb853 |
14 | 1aa0cd42ba1c8 |
15 | b88ce0e60e50 |
hex | 5b0aa1c91394 |
100101222110100 has 36 divisors (see below), whose sum is σ = 289626202639424. Its totient is φ = 26693659229280.
The previous prime is 100101222110083. The next prime is 100101222110119. The reversal of 100101222110100 is 1011222101001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166835369884 + ... + 166835370483.
Almost surely, 2100101222110100 is an apocalyptic number.
100101222110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100101222110100 is an abundant number, since it is smaller than the sum of its proper divisors (189524980529324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100101222110100 is a wasteful number, since it uses less digits than its factorization.
100101222110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333670740384 (or 333670740377 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100101222110100 its reverse (1011222101001), we get a palindrome (101112444211101).
Subtracting from 100101222110100 its reverse (1011222101001), we obtain a palindrome (99090000009099).
The spelling of 100101222110100 in words is "one hundred trillion, one hundred one billion, two hundred twenty-two million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •