Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …000110111110001100000001 |
3 | 111010110102102011112012010010 |
4 | 112300302231012332030001 |
5 | 101110200241004133441 |
6 | 552525522223455133 |
7 | 30041465113661211 |
oct | 2660625506761401 |
9 | 433412364465103 |
10 | 100110002021121 |
11 | 29997460307834 |
12 | b289ba51574a9 |
13 | 43b2442b9ca81 |
14 | 1aa14c83a0241 |
15 | b89156b66116 |
hex | 5b0cad1be301 |
100110002021121 has 8 divisors (see below), whose sum is σ = 139283481072960. Its totient is φ = 63838262158352.
The previous prime is 100110002021101. The next prime is 100110002021131. The reversal of 100110002021121 is 121120200011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100110002021121 - 214 = 100110002004737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100110002021097 and 100110002021106.
It is not an unprimeable number, because it can be changed into a prime (100110002021101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 725434797186 + ... + 725434797323.
It is an arithmetic number, because the mean of its divisors is an integer number (17410435134120).
Almost surely, 2100110002021121 is an apocalyptic number.
It is an amenable number.
100110002021121 is a deficient number, since it is larger than the sum of its proper divisors (39173479051839).
100110002021121 is a wasteful number, since it uses less digits than its factorization.
100110002021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1450869594535.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100110002021121 its reverse (121120200011001), we get a palindrome (221230202032122).
The spelling of 100110002021121 in words is "one hundred trillion, one hundred ten billion, two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •