Base | Representation |
---|---|
bin | 1011000000010101001001… |
… | …0000110001101010001011 |
3 | 1120211202222220212112222202 |
4 | 2300011102100301222023 |
5 | 3041222410032033001 |
6 | 41422445155310415 |
7 | 2356134534323342 |
oct | 260052220615213 |
9 | 46752886775882 |
10 | 12100303002251 |
11 | 3945789654a92 |
12 | 1435152bab40b |
13 | 69a090c0b7a9 |
14 | 2db92cd94b59 |
15 | 15eb53a5d96b |
hex | b0152431a8b |
12100303002251 has 2 divisors, whose sum is σ = 12100303002252. Its totient is φ = 12100303002250.
The previous prime is 12100303002217. The next prime is 12100303002439. The reversal of 12100303002251 is 15220030300121.
It is a weak prime.
It is an emirp because it is prime and its reverse (15220030300121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12100303002251 - 226 = 12100235893387 is a prime.
It is a super-2 number, since 2×121003030022512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12100303002751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050151501125 + 6050151501126.
It is an arithmetic number, because the mean of its divisors is an integer number (6050151501126).
Almost surely, 212100303002251 is an apocalyptic number.
12100303002251 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100303002251 is an equidigital number, since it uses as much as digits as its factorization.
12100303002251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 12100303002251 its reverse (15220030300121), we get a palindrome (27320333302372).
The spelling of 12100303002251 in words is "twelve trillion, one hundred billion, three hundred three million, two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •