Base | Representation |
---|---|
bin | 1011000110101110111010… |
… | …0110110100110010000111 |
3 | 1121020021220211000200112122 |
4 | 2301223232212310302013 |
5 | 3100023143323212221 |
6 | 41545200125240155 |
7 | 2400110423215130 |
oct | 261535646646207 |
9 | 47207824020478 |
10 | 12210300210311 |
11 | 39883a5168505 |
12 | 1452530a0305b |
13 | 6a757096b958 |
14 | 302da5a4cc87 |
15 | 1629407a3eab |
hex | b1aee9b4c87 |
12210300210311 has 8 divisors (see below), whose sum is σ = 13955382571680. Its totient is φ = 10465406288928.
The previous prime is 12210300210293. The next prime is 12210300210313. The reversal of 12210300210311 is 11301200301221.
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-12210300210311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12210300210311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210300210313) 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, 46971116 + ... + 47230353.
It is an arithmetic number, because the mean of its divisors is an integer number (1744422821460).
Almost surely, 212210300210311 is an apocalyptic number.
12210300210311 is a deficient number, since it is larger than the sum of its proper divisors (1745082361369).
12210300210311 is an equidigital number, since it uses as much as digits as its factorization.
12210300210311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94219993.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12210300210311 its reverse (11301200301221), we get a palindrome (23511500511532).
The spelling of 12210300210311 in words is "twelve trillion, two hundred ten billion, three hundred million, two hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •