Base | Representation |
---|---|
bin | 1101000110010001000110… |
… | …0100110101001010111101 |
3 | 1212222202022202200222221222 |
4 | 3101210101210311022331 |
5 | 3341422400433224013 |
6 | 50343513012003125 |
7 | 3014314066020452 |
oct | 321442144651275 |
9 | 55882282628858 |
10 | 14401320211133 |
11 | 46526248aa169 |
12 | 17470a50004a5 |
13 | 806066c557bb |
14 | 37b055ad3829 |
15 | 19e92867a508 |
hex | d19119352bd |
14401320211133 has 4 divisors (see below), whose sum is σ = 14401445992800. Its totient is φ = 14401194429468.
The previous prime is 14401320211093. The next prime is 14401320211177. The reversal of 14401320211133 is 33111202310441.
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 14401320211133 - 214 = 14401320194749 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 (14401320211183) 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, 62718935 + ... + 62948132.
It is an arithmetic number, because the mean of its divisors is an integer number (3600361498200).
Almost surely, 214401320211133 is an apocalyptic number.
It is an amenable number.
14401320211133 is a deficient number, since it is larger than the sum of its proper divisors (125781667).
14401320211133 is a wasteful number, since it uses less digits than its factorization.
14401320211133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125781666.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 14401320211133 its reverse (33111202310441), we get a palindrome (47512522521574).
The spelling of 14401320211133 in words is "fourteen trillion, four hundred one billion, three hundred twenty million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •