Base | Representation |
---|---|
bin | 1011001100011011100111… |
… | …0110011110110000000101 |
3 | 1121120122121120120021022001 |
4 | 2303012321312132300011 |
5 | 3103124143014312413 |
6 | 42102150404105301 |
7 | 2410144440306031 |
oct | 263067166366005 |
9 | 47518546507261 |
10 | 12308199369733 |
11 | 3a15972740a23 |
12 | 14694b3095231 |
13 | 6b3873157a57 |
14 | 307a11a851c1 |
15 | 16527035c4dd |
hex | b31b9d9ec05 |
12308199369733 has 2 divisors, whose sum is σ = 12308199369734. Its totient is φ = 12308199369732.
The previous prime is 12308199369731. The next prime is 12308199369737. The reversal of 12308199369733 is 33796399180321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12236234869089 + 71964500644 = 3498033^2 + 268262^2 .
It is a cyclic number.
It is not a de Polignac number, because 12308199369733 - 21 = 12308199369731 is a prime.
Together with 12308199369731, 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 (12308199369731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6154099684866 + 6154099684867.
It is an arithmetic number, because the mean of its divisors is an integer number (6154099684867).
Almost surely, 212308199369733 is an apocalyptic number.
It is an amenable number.
12308199369733 is a deficient number, since it is larger than the sum of its proper divisors (1).
12308199369733 is an equidigital number, since it uses as much as digits as its factorization.
12308199369733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39680928, while the sum is 64.
The spelling of 12308199369733 in words is "twelve trillion, three hundred eight billion, one hundred ninety-nine million, three hundred sixty-nine thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •