Base | Representation |
---|---|
bin | 1100110000110110010001… |
… | …0100010110010111100101 |
3 | 1211200120111200022000112011 |
4 | 3030031210110112113211 |
5 | 3314410240322242013 |
6 | 45502454500554221 |
7 | 2645606164105465 |
oct | 314154424262745 |
9 | 54616450260464 |
10 | 14033341212133 |
11 | 45205632a1861 |
12 | 16a79096b2971 |
13 | 7aa4525ca839 |
14 | 36730853dba5 |
15 | 19508d01ac3d |
hex | cc3645165e5 |
14033341212133 has 2 divisors, whose sum is σ = 14033341212134. Its totient is φ = 14033341212132.
The previous prime is 14033341212127. The next prime is 14033341212173. The reversal of 14033341212133 is 33121214333041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11253461925924 + 2779879286209 = 3354618^2 + 1667297^2 .
It is a cyclic number.
It is not a de Polignac number, because 14033341212133 - 25 = 14033341212101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14033341212095 and 14033341212104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14033341212173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7016670606066 + 7016670606067.
It is an arithmetic number, because the mean of its divisors is an integer number (7016670606067).
Almost surely, 214033341212133 is an apocalyptic number.
It is an amenable number.
14033341212133 is a deficient number, since it is larger than the sum of its proper divisors (1).
14033341212133 is an equidigital number, since it uses as much as digits as its factorization.
14033341212133 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 31.
Adding to 14033341212133 its reverse (33121214333041), we get a palindrome (47154555545174).
The spelling of 14033341212133 in words is "fourteen trillion, thirty-three billion, three hundred forty-one million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •