Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …001001010110100010100100 |
3 | 111010002212120121010200110100 |
4 | 112233111223021112202210 |
5 | 101102031201420213332 |
6 | 552412002154424100 |
7 | 30031330533113133 |
oct | 2657255311264244 |
9 | 433085517120410 |
10 | 100010111101092 |
11 | 29959060505075 |
12 | b272767a32030 |
13 | 43a5bb3b629ba |
14 | 1a9a72da1591a |
15 | b8675c2c667c |
hex | 5af56b2568a4 |
100010111101092 has 36 divisors (see below), whose sum is σ = 252867843854080. Its totient is φ = 33328197222192.
The previous prime is 100010111101027. The next prime is 100010111101099. The reversal of 100010111101092 is 290101111010001.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (100010111101099) 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, 354293548 + ... + 354575715.
Almost surely, 2100010111101092 is an apocalyptic number.
100010111101092 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100010111101092 is an abundant number, since it is smaller than the sum of its proper divisors (152857732752988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010111101092 is a wasteful number, since it uses less digits than its factorization.
100010111101092 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 708873192 (or 708873187 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
Adding to 100010111101092 its reverse (290101111010001), we get a palindrome (390111222111093).
The spelling of 100010111101092 in words is "one hundred trillion, ten billion, one hundred eleven million, one hundred one thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •