Base | Representation |
---|---|
bin | 1011000110101101110011… |
… | …0110011110011010110001 |
3 | 1121020021011001111110010202 |
4 | 2301223130312132122301 |
5 | 3100022041043314441 |
6 | 41545110404404545 |
7 | 2400100145215301 |
oct | 261533466363261 |
9 | 47207131443122 |
10 | 12210002323121 |
11 | 3988261aa7449 |
12 | 14524690a6755 |
13 | 6a7524030745 |
14 | 302d78269601 |
15 | 16292456119b |
hex | b1adcd9e6b1 |
12210002323121 has 8 divisors (see below), whose sum is σ = 12224628321600. Its totient is φ = 12195379239120.
The previous prime is 12210002323091. The next prime is 12210002323139. The reversal of 12210002323121 is 12132320001221.
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-12210002323121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12210002323093 and 12210002323102.
It is not an unprimeable number, because it can be changed into a prime (12210002323021) 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, 7713770 + ... + 9160908.
It is an arithmetic number, because the mean of its divisors is an integer number (1528078540200).
Almost surely, 212210002323121 is an apocalyptic number.
It is an amenable number.
12210002323121 is a deficient number, since it is larger than the sum of its proper divisors (14625998479).
12210002323121 is an equidigital number, since it uses as much as digits as its factorization.
12210002323121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457239.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12210002323121 its reverse (12132320001221), we get a palindrome (24342322324342).
The spelling of 12210002323121 in words is "twelve trillion, two hundred ten billion, two million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •