Base | Representation |
---|---|
bin | 1101001000000001110010… |
… | …1110010001000101011110 |
3 | 1220002122102001210100212210 |
4 | 3102000130232101011132 |
5 | 3342421324413131324 |
6 | 50405434520541250 |
7 | 3016434544023030 |
oct | 322003456210536 |
9 | 56078361710783 |
10 | 14431572005214 |
11 | 4664439191881 |
12 | 1750b28321826 |
13 | 808b7853aa80 |
14 | 37c6c5763c50 |
15 | 1a05e943ed29 |
hex | d201cb9115e |
14431572005214 has 32 divisors (see below), whose sum is σ = 35523869552640. Its totient is φ = 3806128880352.
The previous prime is 14431572005209. The next prime is 14431572005297. The reversal of 14431572005214 is 41250027513441.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 13215724734 + ... + 13215725825.
It is an arithmetic number, because the mean of its divisors is an integer number (1110120923520).
Almost surely, 214431572005214 is an apocalyptic number.
14431572005214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
14431572005214 is an abundant number, since it is smaller than the sum of its proper divisors (21092297547426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14431572005214 is a wasteful number, since it uses less digits than its factorization.
14431572005214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26431450584.
The product of its (nonzero) digits is 134400, while the sum is 39.
Adding to 14431572005214 its reverse (41250027513441), we get a palindrome (55681599518655).
The spelling of 14431572005214 in words is "fourteen trillion, four hundred thirty-one billion, five hundred seventy-two million, five thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •