Base | Representation |
---|---|
bin | 1011001100000101000000… |
… | …0110110111000010001111 |
3 | 1121120001221121120011021111 |
4 | 2303001100012313002033 |
5 | 3103024230324430221 |
6 | 42055304243112451 |
7 | 2406541154205121 |
oct | 263012006670217 |
9 | 47501847504244 |
10 | 12302130311311 |
11 | 3a13338932565 |
12 | 146829a672727 |
13 | 6b311698cc19 |
14 | 3075d7a1b211 |
15 | 165017632be1 |
hex | b30501b708f |
12302130311311 has 4 divisors (see below), whose sum is σ = 12302147851192. Its totient is φ = 12302112771432.
The previous prime is 12302130311221. The next prime is 12302130311411. The reversal of 12302130311311 is 11311303120321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12302130311311 - 219 = 12302129787023 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12302130311011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7672056 + ... + 9135901.
It is an arithmetic number, because the mean of its divisors is an integer number (3075536962798).
Almost surely, 212302130311311 is an apocalyptic number.
12302130311311 is a deficient number, since it is larger than the sum of its proper divisors (17539881).
12302130311311 is an equidigital number, since it uses as much as digits as its factorization.
12302130311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17539880.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12302130311311 its reverse (11311303120321), we get a palindrome (23613433431632).
The spelling of 12302130311311 in words is "twelve trillion, three hundred two billion, one hundred thirty million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •