Base | Representation |
---|---|
bin | 10011010110111100001… |
… | …111001101111010100111 |
3 | 11201011202002210100210001 |
4 | 103112330033031322213 |
5 | 133243430032001411 |
6 | 2455044402042131 |
7 | 165053101634002 |
oct | 23267417157247 |
9 | 4634662710701 |
10 | 1330303000231 |
11 | 4731a63a9837 |
12 | 1959a3949347 |
13 | 985a719aaca |
14 | 4855bd48539 |
15 | 2490e451dc1 |
hex | 135bc3cdea7 |
1330303000231 has 2 divisors, whose sum is σ = 1330303000232. Its totient is φ = 1330303000230.
The previous prime is 1330303000151. The next prime is 1330303000289. The reversal of 1330303000231 is 1320003030331.
It is a strong prime.
It is an emirp because it is prime and its reverse (1320003030331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1330303000231 is a prime.
It is a super-2 number, since 2×13303030002312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1330303000199 and 1330303000208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330304000231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665151500115 + 665151500116.
It is an arithmetic number, because the mean of its divisors is an integer number (665151500116).
Almost surely, 21330303000231 is an apocalyptic number.
1330303000231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330303000231 is an equidigital number, since it uses as much as digits as its factorization.
1330303000231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 1330303000231 its reverse (1320003030331), we get a palindrome (2650306030562).
The spelling of 1330303000231 in words is "one trillion, three hundred thirty billion, three hundred three million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •