Base | Representation |
---|---|
bin | 1101001000000000011011… |
… | …0010110111101110011111 |
3 | 1220002121110102112112001202 |
4 | 3102000012302313232133 |
5 | 3342420101223111221 |
6 | 50405334215430115 |
7 | 3016422456006626 |
oct | 322000662675637 |
9 | 56077412475052 |
10 | 14431204113311 |
11 | 466426a557187 |
12 | 1750a4508533b |
13 | 808b1a25bb5b |
14 | 37c68c95a6bd |
15 | 1a05c6ebed0b |
hex | d2006cb7b9f |
14431204113311 has 8 divisors (see below), whose sum is σ = 14821372135920. Its totient is φ = 14041043221248.
The previous prime is 14431204113301. The next prime is 14431204113349. The reversal of 14431204113311 is 11331140213441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14431204113311 - 222 = 14431199919007 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 (14431204113301) 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, 2454095 + ... + 5906351.
It is an arithmetic number, because the mean of its divisors is an integer number (1852671516990).
Almost surely, 214431204113311 is an apocalyptic number.
14431204113311 is a deficient number, since it is larger than the sum of its proper divisors (390168022609).
14431204113311 is a wasteful number, since it uses less digits than its factorization.
14431204113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3565273.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 14431204113311 its reverse (11331140213441), we get a palindrome (25762344326752).
The spelling of 14431204113311 in words is "fourteen trillion, four hundred thirty-one billion, two hundred four million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •