Base | Representation |
---|---|
bin | 11010010010000101… |
… | …10111100010100101 |
3 | 1100102101012002210020 |
4 | 31021002313202211 |
5 | 212344224443222 |
6 | 10252054345353 |
7 | 1006445224353 |
oct | 151102674245 |
9 | 40371162706 |
10 | 14110390437 |
11 | 5a90a47200 |
12 | 289965b259 |
13 | 143b44cb70 |
14 | 97c0107d3 |
15 | 578b8b65c |
hex | 3490b78a5 |
14110390437 has 24 divisors (see below), whose sum is σ = 22270443552. Its totient is φ = 7893922080.
The previous prime is 14110390417. The next prime is 14110390477. The reversal of 14110390437 is 73409301141.
It is not a de Polignac number, because 14110390437 - 219 = 14109866149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 14110390398 and 14110390407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14110390417) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1490343 + ... + 1499780.
It is an arithmetic number, because the mean of its divisors is an integer number (927935148).
Almost surely, 214110390437 is an apocalyptic number.
It is an amenable number.
14110390437 is a deficient number, since it is larger than the sum of its proper divisors (8160053115).
14110390437 is a wasteful number, since it uses less digits than its factorization.
14110390437 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2990161 (or 2990150 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
Adding to 14110390437 its reverse (73409301141), we get a palindrome (87519691578).
It can be divided in two parts, 141103 and 90437, that added together give a triangular number (231540 = T680).
The spelling of 14110390437 in words is "fourteen billion, one hundred ten million, three hundred ninety thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •