Base | Representation |
---|---|
bin | 11010010010001101… |
… | …01111000110001000 |
3 | 1100102110002121201022 |
4 | 31021012233012020 |
5 | 212400004420144 |
6 | 10252132212012 |
7 | 1006456646525 |
oct | 151106570610 |
9 | 40373077638 |
10 | 14111404424 |
11 | 5a9157a007 |
12 | 2899a6a008 |
13 | 143b716560 |
14 | 97c1d614c |
15 | 578cdbcee |
hex | 3491af188 |
14111404424 has 64 divisors (see below), whose sum is σ = 30213388800. Its totient is φ = 6125013504.
The previous prime is 14111404399. The next prime is 14111404441. The reversal of 14111404424 is 42440411141.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 14111404393 and 14111404402.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 244649 + ... + 296775.
It is an arithmetic number, because the mean of its divisors is an integer number (472084200).
Almost surely, 214111404424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14111404424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15106694400).
14111404424 is an abundant number, since it is smaller than the sum of its proper divisors (16101984376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14111404424 is a wasteful number, since it uses less digits than its factorization.
14111404424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52302 (or 52298 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 26.
Adding to 14111404424 its reverse (42440411141), we get a palindrome (56551815565).
The spelling of 14111404424 in words is "fourteen billion, one hundred eleven million, four hundred four thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •