Base | Representation |
---|---|
bin | 11011000100001111… |
… | …00010001010100101 |
3 | 1101111200201112000000 |
4 | 31202013202022211 |
5 | 214224421402010 |
6 | 10401522411513 |
7 | 1023043556532 |
oct | 154207421245 |
9 | 41450645000 |
10 | 14531044005 |
11 | 6187439485 |
12 | 2996500b99 |
13 | 14a76431ba |
14 | 9bbc2dd89 |
15 | 5a0a7e7c0 |
hex | 3621e22a5 |
14531044005 has 56 divisors (see below), whose sum is σ = 26987481600. Its totient is φ = 7499835360.
The previous prime is 14531044001. The next prime is 14531044013. The reversal of 14531044005 is 50044013541.
It is a happy number.
It is not a de Polignac number, because 14531044005 - 22 = 14531044001 is a prime.
It is a super-2 number, since 2×145310440052 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 14531044005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14531044001) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 48696 + ... + 177294.
Almost surely, 214531044005 is an apocalyptic number.
14531044005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14531044005 is a deficient number, since it is larger than the sum of its proper divisors (12456437595).
14531044005 is an equidigital number, since it uses as much as digits as its factorization.
14531044005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128653 (or 128638 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 14531044005 its reverse (50044013541), we get a palindrome (64575057546).
The spelling of 14531044005 in words is "fourteen billion, five hundred thirty-one million, forty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •