Base | Representation |
---|---|
bin | 10010111101110010111… |
… | …011001001110100001011 |
3 | 11121121001102220101210022 |
4 | 102331302323021310023 |
5 | 132323131104400021 |
6 | 2434421302411055 |
7 | 163106032262201 |
oct | 22756273116413 |
9 | 4547042811708 |
10 | 1303303200011 |
11 | 46280075225a |
12 | 190709730a8b |
13 | 95b9355a167 |
14 | 4711a159071 |
15 | 23d7de0b1ab |
hex | 12f72ec9d0b |
1303303200011 has 2 divisors, whose sum is σ = 1303303200012. Its totient is φ = 1303303200010.
The previous prime is 1303303199971. The next prime is 1303303200037. The reversal of 1303303200011 is 1100023033031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1303303200011 - 214 = 1303303183627 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1303303200061) 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, 651651600005 + 651651600006.
It is an arithmetic number, because the mean of its divisors is an integer number (651651600006).
Almost surely, 21303303200011 is an apocalyptic number.
1303303200011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303303200011 is an equidigital number, since it uses as much as digits as its factorization.
1303303200011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1303303200011 its reverse (1100023033031), we get a palindrome (2403326233042).
The spelling of 1303303200011 in words is "one trillion, three hundred three billion, three hundred three million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •