Base | Representation |
---|---|
bin | 1011001100001000010000… |
… | …0001001011001010000101 |
3 | 1121120011012022100201111012 |
4 | 2303002010001023022011 |
5 | 3103033021304023401 |
6 | 42055530514052005 |
7 | 2406601561016342 |
oct | 263020401131205 |
9 | 47504168321435 |
10 | 12303001236101 |
11 | 3a13745506214 |
12 | 14684a227a005 |
13 | 6b3225246534 |
14 | 30767b5697c9 |
15 | 165068d198bb |
hex | b308404b285 |
12303001236101 has 2 divisors, whose sum is σ = 12303001236102. Its totient is φ = 12303001236100.
The previous prime is 12303001236059. The next prime is 12303001236103. The reversal of 12303001236101 is 10163210030321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11396937124225 + 906064111876 = 3375935^2 + 951874^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303001236101 is a prime.
Together with 12303001236103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12303001236103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6151500618050 + 6151500618051.
It is an arithmetic number, because the mean of its divisors is an integer number (6151500618051).
Almost surely, 212303001236101 is an apocalyptic number.
It is an amenable number.
12303001236101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303001236101 is an equidigital number, since it uses as much as digits as its factorization.
12303001236101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12303001236101 its reverse (10163210030321), we get a palindrome (22466211266422).
The spelling of 12303001236101 in words is "twelve trillion, three hundred three billion, one million, two hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •