Base | Representation |
---|---|
bin | 1011001011111101011100… |
… | …0101111010101110000001 |
3 | 1121112212201010012201201112 |
4 | 2302333113011322232001 |
5 | 3103011101101133441 |
6 | 42054330555013105 |
7 | 2406436642055543 |
oct | 262772705725601 |
9 | 47485633181645 |
10 | 12300100021121 |
11 | 3a12496887490 |
12 | 1467a1273a195 |
13 | 6b2b8216b793 |
14 | 307484119693 |
15 | 164e4928a4eb |
hex | b2fd717ab81 |
12300100021121 has 32 divisors (see below), whose sum is σ = 13666472202240. Its totient is φ = 10977160521600.
The previous prime is 12300100021093. The next prime is 12300100021151. The reversal of 12300100021121 is 12112000100321.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12300100021121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12300100021096 and 12300100021105.
It is not an unprimeable number, because it can be changed into a prime (12300100021151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141403640 + ... + 141490598.
It is an arithmetic number, because the mean of its divisors is an integer number (427077256320).
Almost surely, 212300100021121 is an apocalyptic number.
12300100021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12300100021121 is a deficient number, since it is larger than the sum of its proper divisors (1366372181119).
12300100021121 is a wasteful number, since it uses less digits than its factorization.
12300100021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88157.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 12300100021121 its reverse (12112000100321), we get a palindrome (24412100121442).
The spelling of 12300100021121 in words is "twelve trillion, three hundred billion, one hundred million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •