Base | Representation |
---|---|
bin | 1011001100000100111110… |
… | …0100000111001010000101 |
3 | 1121120001220222102101002001 |
4 | 2303001033210013022011 |
5 | 3103024221011433214 |
6 | 42055303315545301 |
7 | 2406541013606221 |
oct | 263011744071205 |
9 | 47501828371061 |
10 | 12302121202309 |
11 | 3a13333780864 |
12 | 14682975bb231 |
13 | 6b3114b20a93 |
14 | 3075d6729781 |
15 | 165016933c74 |
hex | b304f907285 |
12302121202309 has 4 divisors (see below), whose sum is σ = 12836996037216. Its totient is φ = 11767246367404.
The previous prime is 12302121202297. The next prime is 12302121202367. The reversal of 12302121202309 is 90320212120321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12302121202309 - 27 = 12302121202181 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 (12302121202379) 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, 267437417419 + ... + 267437417464.
It is an arithmetic number, because the mean of its divisors is an integer number (3209249009304).
Almost surely, 212302121202309 is an apocalyptic number.
It is an amenable number.
12302121202309 is a deficient number, since it is larger than the sum of its proper divisors (534874834907).
12302121202309 is an equidigital number, since it uses as much as digits as its factorization.
12302121202309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534874834906.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 12302121202309 in words is "twelve trillion, three hundred two billion, one hundred twenty-one million, two hundred two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •