Base | Representation |
---|---|
bin | 1100111010101011110101… |
… | …1100101110000111010001 |
3 | 1212021201201111220100212102 |
4 | 3032222331130232013101 |
5 | 3330142343104201223 |
6 | 50112244242010145 |
7 | 2664041142506231 |
oct | 316527534560721 |
9 | 55251644810772 |
10 | 14202340303313 |
11 | 45861a6935358 |
12 | 1714613046955 |
13 | 7c0376089b86 |
14 | 37157b2adcc1 |
15 | 19967ea55928 |
hex | ceabd72e1d1 |
14202340303313 has 2 divisors, whose sum is σ = 14202340303314. Its totient is φ = 14202340303312.
The previous prime is 14202340303301. The next prime is 14202340303343. The reversal of 14202340303313 is 31330304320241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14181498183889 + 20842119424 = 3765833^2 + 144368^2 .
It is a cyclic number.
It is not a de Polignac number, because 14202340303313 - 24 = 14202340303297 is a prime.
It is a super-2 number, since 2×142023403033132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14202340303343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7101170151656 + 7101170151657.
It is an arithmetic number, because the mean of its divisors is an integer number (7101170151657).
Almost surely, 214202340303313 is an apocalyptic number.
It is an amenable number.
14202340303313 is a deficient number, since it is larger than the sum of its proper divisors (1).
14202340303313 is an equidigital number, since it uses as much as digits as its factorization.
14202340303313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 14202340303313 its reverse (31330304320241), we get a palindrome (45532644623554).
The spelling of 14202340303313 in words is "fourteen trillion, two hundred two billion, three hundred forty million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •