Base | Representation |
---|---|
bin | 1101001000100110100001… |
… | …0100101011100101101001 |
3 | 1220010120212002220200102011 |
4 | 3102021220110223211221 |
5 | 3343102022124113113 |
6 | 50414145042235521 |
7 | 3020234051116201 |
oct | 322115024534551 |
9 | 56116762820364 |
10 | 14441430301033 |
11 | 4668637a1039a |
12 | 1752a19955ba1 |
13 | 809a89a722c8 |
14 | 37cd7cb5b401 |
15 | 1a09c4b5b63d |
hex | d226852b969 |
14441430301033 has 2 divisors, whose sum is σ = 14441430301034. Its totient is φ = 14441430301032.
The previous prime is 14441430301027. The next prime is 14441430301073. The reversal of 14441430301033 is 33010303414441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12194992889689 + 2246437411344 = 3492133^2 + 1498812^2 .
It is a cyclic number.
It is not a de Polignac number, because 14441430301033 - 213 = 14441430292841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14441430300986 and 14441430301004.
It is not a weakly prime, because it can be changed into another prime (14441430301073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7220715150516 + 7220715150517.
It is an arithmetic number, because the mean of its divisors is an integer number (7220715150517).
Almost surely, 214441430301033 is an apocalyptic number.
It is an amenable number.
14441430301033 is a deficient number, since it is larger than the sum of its proper divisors (1).
14441430301033 is an equidigital number, since it uses as much as digits as its factorization.
14441430301033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 14441430301033 its reverse (33010303414441), we get a palindrome (47451733715474).
The spelling of 14441430301033 in words is "fourteen trillion, four hundred forty-one billion, four hundred thirty million, three hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •