Base | Representation |
---|---|
bin | 1101000111010111100011… |
… | …1001000101101101110101 |
3 | 1220001120010212021210021001 |
4 | 3101311320321011231311 |
5 | 3342230114230203323 |
6 | 50400321440123301 |
7 | 3015553553604622 |
oct | 321657071055565 |
9 | 56046125253231 |
10 | 14420233444213 |
11 | 465a64a932103 |
12 | 174a8a3006531 |
13 | 807a8c433a8c |
14 | 37bd2b923349 |
15 | 1a0183cc63ad |
hex | d1d78e45b75 |
14420233444213 has 4 divisors (see below), whose sum is σ = 14635460809120. Its totient is φ = 14205006079308.
The previous prime is 14420233444207. The next prime is 14420233444223. The reversal of 14420233444213 is 31244433202441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14420233444213 - 25 = 14420233444181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14420233444223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107613682353 + ... + 107613682486.
It is an arithmetic number, because the mean of its divisors is an integer number (3658865202280).
Almost surely, 214420233444213 is an apocalyptic number.
It is an amenable number.
14420233444213 is a deficient number, since it is larger than the sum of its proper divisors (215227364907).
14420233444213 is an equidigital number, since it uses as much as digits as its factorization.
14420233444213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215227364906.
The product of its (nonzero) digits is 221184, while the sum is 37.
Adding to 14420233444213 its reverse (31244433202441), we get a palindrome (45664666646654).
The spelling of 14420233444213 in words is "fourteen trillion, four hundred twenty billion, two hundred thirty-three million, four hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •