Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …101100010001011101011001 |
3 | 111010111101020201020000112210 |
4 | 112300330001230101131121 |
5 | 101110331240310120441 |
6 | 552534255331225333 |
7 | 30042301131033261 |
oct | 2660740154213531 |
9 | 433441221200483 |
10 | 100120011020121 |
11 | 299a0727108934 |
12 | b28bb19148249 |
13 | 43b33796bb2a1 |
14 | 1aa1b977c67a1 |
15 | b89540700616 |
hex | 5b0f01b11759 |
100120011020121 has 8 divisors (see below), whose sum is σ = 133629150012480. Its totient is φ = 66678773020592.
The previous prime is 100120011020089. The next prime is 100120011020137. The reversal of 100120011020121 is 121020110021001.
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 100120011020121 - 25 = 100120011020089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100120011020097 and 100120011020106.
It is not an unprimeable number, because it can be changed into a prime (100120011020521) 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, 16975244766 + ... + 16975250663.
It is an arithmetic number, because the mean of its divisors is an integer number (16703643751560).
Almost surely, 2100120011020121 is an apocalyptic number.
It is an amenable number.
100120011020121 is a deficient number, since it is larger than the sum of its proper divisors (33509138992359).
100120011020121 is an equidigital number, since it uses as much as digits as its factorization.
100120011020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33950496415.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100120011020121 its reverse (121020110021001), we get a palindrome (221140121041122).
The spelling of 100120011020121 in words is "one hundred trillion, one hundred twenty billion, eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •