Base | Representation |
---|---|
bin | 1011000000010100100000… |
… | …0001000001010111011001 |
3 | 1120211202112221102000121012 |
4 | 2300011020001001113121 |
5 | 3041222032030200441 |
6 | 41422420135023305 |
7 | 2356130346223061 |
oct | 260051001012731 |
9 | 46752487360535 |
10 | 12100131100121 |
11 | 3945700613409 |
12 | 143510550ab35 |
13 | 69a06441175c |
14 | 2db9142083a1 |
15 | 15eb439049eb |
hex | b01480415d9 |
12100131100121 has 8 divisors (see below), whose sum is σ = 12626678327424. Its totient is φ = 11573621753760.
The previous prime is 12100131100091. The next prime is 12100131100129. The reversal of 12100131100121 is 12100113100121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12100131100121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12100131100096 and 12100131100105.
It is not an unprimeable number, because it can be changed into a prime (12100131100129) 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, 8816525 + ... + 10096106.
It is an arithmetic number, because the mean of its divisors is an integer number (1578334790928).
Almost surely, 212100131100121 is an apocalyptic number.
It is an amenable number.
12100131100121 is a deficient number, since it is larger than the sum of its proper divisors (526547227303).
12100131100121 is a wasteful number, since it uses less digits than its factorization.
12100131100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18940471.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 12100131100121 its reverse (12100113100121), we get a palindrome (24200244200242).
The spelling of 12100131100121 in words is "twelve trillion, one hundred billion, one hundred thirty-one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •