Base | Representation |
---|---|
bin | 1011001100001001000000… |
… | …0110010100101011011101 |
3 | 1121120011201102201202010021 |
4 | 2303002100012110223131 |
5 | 3103033430200144123 |
6 | 42100002554112141 |
7 | 2406606601521361 |
oct | 263022006245335 |
9 | 47504642652107 |
10 | 12303203912413 |
11 | 3a138399569a7 |
12 | 146853a11b651 |
13 | 6b3258229a4b |
14 | 30769a4472a1 |
15 | 16507ba01c5d |
hex | b3090194add |
12303203912413 has 2 divisors, whose sum is σ = 12303203912414. Its totient is φ = 12303203912412.
The previous prime is 12303203912411. The next prime is 12303203912471. The reversal of 12303203912413 is 31421930230321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12292337517849 + 10866394564 = 3506043^2 + 104242^2 .
It is a cyclic number.
It is not a de Polignac number, because 12303203912413 - 21 = 12303203912411 is a prime.
Together with 12303203912411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12303203912411) 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 as a sum of consecutive naturals, namely, 6151601956206 + 6151601956207.
It is an arithmetic number, because the mean of its divisors is an integer number (6151601956207).
Almost surely, 212303203912413 is an apocalyptic number.
It is an amenable number.
12303203912413 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303203912413 is an equidigital number, since it uses as much as digits as its factorization.
12303203912413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 34.
The spelling of 12303203912413 in words is "twelve trillion, three hundred three billion, two hundred three million, nine hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •