Base | Representation |
---|---|
bin | 11010010010001100… |
… | …00000001011010000 |
3 | 1100102102201212002101 |
4 | 31021012000023100 |
5 | 212344432242430 |
6 | 10252124130144 |
7 | 1006455216316 |
oct | 151106001320 |
9 | 40372655071 |
10 | 14111212240 |
11 | 5a91458684 |
12 | 2899996954 |
13 | 143b679c38 |
14 | 97c1860b6 |
15 | 578c9edca |
hex | 3491802d0 |
14111212240 has 40 divisors (see below), whose sum is σ = 32813971200. Its totient is φ = 5643555456.
The previous prime is 14111212217. The next prime is 14111212249. The reversal of 14111212240 is 4221211141.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14111212249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 681561 + ... + 701959.
It is an arithmetic number, because the mean of its divisors is an integer number (820349280).
Almost surely, 214111212240 is an apocalyptic number.
14111212240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14111212240 is an abundant number, since it is smaller than the sum of its proper divisors (18702758960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14111212240 is a wasteful number, since it uses less digits than its factorization.
14111212240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29059 (or 29053 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 14111212240 its reverse (4221211141), we get a palindrome (18332423381).
The spelling of 14111212240 in words is "fourteen billion, one hundred eleven million, two hundred twelve thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •