Base | Representation |
---|---|
bin | 1011001110011110011111… |
… | …0111011001101001110101 |
3 | 1121201000021222010010222022 |
4 | 2303213213313121221311 |
5 | 3104213120230220201 |
6 | 42130240435042525 |
7 | 2412530152144304 |
oct | 263474767315165 |
9 | 47630258103868 |
10 | 12343331101301 |
11 | 3a29860686922 |
12 | 1474278740445 |
13 | 6b6c817523b5 |
14 | 3095c588243b |
15 | 16612975e41b |
hex | b39e7dd9a75 |
12343331101301 has 2 divisors, whose sum is σ = 12343331101302. Its totient is φ = 12343331101300.
The previous prime is 12343331101267. The next prime is 12343331101307. The reversal of 12343331101301 is 10310113334321.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7699370751076 + 4643960350225 = 2774774^2 + 2154985^2 .
It is a cyclic number.
It is not a de Polignac number, because 12343331101301 - 218 = 12343330839157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12343331101307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6171665550650 + 6171665550651.
It is an arithmetic number, because the mean of its divisors is an integer number (6171665550651).
Almost surely, 212343331101301 is an apocalyptic number.
It is an amenable number.
12343331101301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12343331101301 is an equidigital number, since it uses as much as digits as its factorization.
12343331101301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 12343331101301 its reverse (10310113334321), we get a palindrome (22653444435622).
The spelling of 12343331101301 in words is "twelve trillion, three hundred forty-three billion, three hundred thirty-one million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •