Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …100001111111110100010111 |
3 | 111010002212021212022022112200 |
4 | 112233111210201333310113 |
5 | 101102030440012333421 |
6 | 552411543152015543 |
7 | 30031325014600263 |
oct | 2657254441776427 |
9 | 433085255268480 |
10 | 100010000121111 |
11 | 299590038a4183 |
12 | b2727368315b3 |
13 | 43a5b96b76582 |
14 | 1a9a71cda70a3 |
15 | b867526a3726 |
hex | 5af56487fd17 |
100010000121111 has 24 divisors (see below), whose sum is σ = 145575598896000. Its totient is φ = 66158439453072.
The previous prime is 100010000121091. The next prime is 100010000121167. The reversal of 100010000121111 is 111121000010001.
It is not a de Polignac number, because 100010000121111 - 215 = 100010000088343 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100010000121093 and 100010000121102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010000121181) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18922401 + ... + 23623658.
It is an arithmetic number, because the mean of its divisors is an integer number (6065649954000).
Almost surely, 2100010000121111 is an apocalyptic number.
100010000121111 is a deficient number, since it is larger than the sum of its proper divisors (45565598774889).
100010000121111 is a wasteful number, since it uses less digits than its factorization.
100010000121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42548083 (or 42548080 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100010000121111 its reverse (111121000010001), we get a palindrome (211131000131112).
The spelling of 100010000121111 in words is "one hundred trillion, ten billion, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •