Base | Representation |
---|---|
bin | 1101000111010110110001… |
… | …0100001000110101111101 |
3 | 1220001112121011020012200121 |
4 | 3101311230110020311331 |
5 | 3342224201220243401 |
6 | 50400244501254541 |
7 | 3015545412201220 |
oct | 321655424106575 |
9 | 56045534205617 |
10 | 14420022431101 |
11 | 465a551807901 |
12 | 174a844404451 |
13 | 807a577c1a51 |
14 | 37bd0b8b55b7 |
15 | 1a01704e3ca1 |
hex | d1d6c508d7d |
14420022431101 has 8 divisors (see below), whose sum is σ = 16488196214720. Its totient is φ = 12353891292288.
The previous prime is 14420022430951. The next prime is 14420022431107. The reversal of 14420022431101 is 10113422002441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14420022431101 - 233 = 14411432496509 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 (14420022431107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 510646071 + ... + 510674308.
It is an arithmetic number, because the mean of its divisors is an integer number (2061024526840).
Almost surely, 214420022431101 is an apocalyptic number.
It is an amenable number.
14420022431101 is a deficient number, since it is larger than the sum of its proper divisors (2068173783619).
14420022431101 is a wasteful number, since it uses less digits than its factorization.
14420022431101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021322403.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14420022431101 its reverse (10113422002441), we get a palindrome (24533444433542).
The spelling of 14420022431101 in words is "fourteen trillion, four hundred twenty billion, twenty-two million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •