Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …011111000000100101011000 |
3 | 111010002212112211020202010222 |
4 | 112233111222133000211120 |
5 | 101102031141100013422 |
6 | 552412001120455212 |
7 | 30031330336552520 |
oct | 2657255237004530 |
9 | 433085484222128 |
10 | 100010100001112 |
11 | 29959055213534 |
12 | b27276417a508 |
13 | 43a5bb1777572 |
14 | 1a9a72c366680 |
15 | b8675b332842 |
hex | 5af56a7c0958 |
100010100001112 has 32 divisors (see below), whose sum is σ = 216429212178720. Its totient is φ = 42437100422400.
The previous prime is 100010100001109. The next prime is 100010100001129. The reversal of 100010100001112 is 211100001010001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 100010100001112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8841056933 + ... + 8841068244.
It is an arithmetic number, because the mean of its divisors is an integer number (6763412880585).
Almost surely, 2100010100001112 is an apocalyptic number.
It is an amenable number.
100010100001112 is an abundant number, since it is smaller than the sum of its proper divisors (116419112177608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010100001112 is a wasteful number, since it uses less digits than its factorization.
100010100001112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17682125291 (or 17682125287 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100010100001112 its reverse (211100001010001), we get a palindrome (311110101011113).
The spelling of 100010100001112 in words is "one hundred trillion, ten billion, one hundred million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •