Base | Representation |
---|---|
bin | 100000000111101000101… |
… | …0011101100100001000101 |
3 | 120122000110010100012202022 |
4 | 1000033101103230201011 |
5 | 1034311234402423323 |
6 | 13215544522052525 |
7 | 633635004335231 |
oct | 100172123544105 |
9 | 16560403305668 |
10 | 4414443014213 |
11 | 1452177aa7351 |
12 | 5b367004a145 |
13 | 260384767a1b |
14 | 1139357795c1 |
15 | 79c6a8454c8 |
hex | 403d14ec845 |
4414443014213 has 2 divisors, whose sum is σ = 4414443014214. Its totient is φ = 4414443014212.
The previous prime is 4414443014173. The next prime is 4414443014369. The reversal of 4414443014213 is 3124103444144.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2866056001249 + 1548387012964 = 1692943^2 + 1244342^2 .
It is a cyclic number.
It is not a de Polignac number, because 4414443014213 - 214 = 4414442997829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4414443014413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2207221507106 + 2207221507107.
It is an arithmetic number, because the mean of its divisors is an integer number (2207221507107).
Almost surely, 24414443014213 is an apocalyptic number.
It is an amenable number.
4414443014213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4414443014213 is an equidigital number, since it uses as much as digits as its factorization.
4414443014213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 4414443014213 its reverse (3124103444144), we get a palindrome (7538546458357).
The spelling of 4414443014213 in words is "four trillion, four hundred fourteen billion, four hundred forty-three million, fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •