Base | Representation |
---|---|
bin | 1101001000000000011101… |
… | …0010001001111011000111 |
3 | 1220002121110222222011201111 |
4 | 3102000013102021323013 |
5 | 3342420110323024221 |
6 | 50405335111305451 |
7 | 3016422615504352 |
oct | 322000722117307 |
9 | 56077428864644 |
10 | 14431212314311 |
11 | 4664274148771 |
12 | 1750a4797b287 |
13 | 808b1bb70910 |
14 | 37c68da93299 |
15 | 1a05c7a8ebe1 |
hex | d2007489ec7 |
14431212314311 has 32 divisors (see below), whose sum is σ = 16095229936128. Its totient is φ = 12849176862720.
The previous prime is 14431212314209. The next prime is 14431212314327. The reversal of 14431212314311 is 11341321213441.
It is a cyclic number.
It is not a de Polignac number, because 14431212314311 - 227 = 14431078096583 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14431212314411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 338128305 + ... + 338170981.
It is an arithmetic number, because the mean of its divisors is an integer number (502975935504).
Almost surely, 214431212314311 is an apocalyptic number.
14431212314311 is a deficient number, since it is larger than the sum of its proper divisors (1664017621817).
14431212314311 is a wasteful number, since it uses less digits than its factorization.
14431212314311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45451.
The product of its digits is 6912, while the sum is 31.
Adding to 14431212314311 its reverse (11341321213441), we get a palindrome (25772533527752).
The spelling of 14431212314311 in words is "fourteen trillion, four hundred thirty-one billion, two hundred twelve million, three hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •