Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …101010111000111100000101 |
3 | 111010110102200211122210002101 |
4 | 112300302303222320330011 |
5 | 101110201002144200401 |
6 | 552525541155112101 |
7 | 30041500621432165 |
oct | 2660626352707405 |
9 | 433412624583071 |
10 | 100110112100101 |
11 | 299975074627a4 |
12 | b28a015ba2631 |
13 | 43b245c93206c |
14 | 1aa14d8c565a5 |
15 | b8916165c101 |
hex | 5b0cb3ab8f05 |
100110112100101 has 16 divisors (see below), whose sum is σ = 100470093850368. Its totient is φ = 99750633177600.
The previous prime is 100110112100081. The next prime is 100110112100153. The reversal of 100110112100101 is 101001211011001.
It is a cyclic number.
It is not a de Polignac number, because 100110112100101 - 225 = 100110078545669 is a prime.
It is a super-3 number, since 3×1001101121001013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110112100171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3085897041 + ... + 3085929481.
It is an arithmetic number, because the mean of its divisors is an integer number (6279380865648).
Almost surely, 2100110112100101 is an apocalyptic number.
It is an amenable number.
100110112100101 is a deficient number, since it is larger than the sum of its proper divisors (359981750267).
100110112100101 is a wasteful number, since it uses less digits than its factorization.
100110112100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39852.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 100110112100101 its reverse (101001211011001), we get a palindrome (201111323111102).
The spelling of 100110112100101 in words is "one hundred trillion, one hundred ten billion, one hundred twelve million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •