Base | Representation |
---|---|
bin | 11010000101101100… |
… | …10100011010110011 |
3 | 1100011010120202020111 |
4 | 31002312110122303 |
5 | 212141122000210 |
6 | 10233502322151 |
7 | 1004043516625 |
oct | 150266243263 |
9 | 40133522214 |
10 | 14006437555 |
11 | 5a382a5930 |
12 | 286a889357 |
13 | 1422a54096 |
14 | 96c2b0c15 |
15 | 56e9a588a |
hex | 342d946b3 |
14006437555 has 16 divisors (see below), whose sum is σ = 18375335424. Its totient is φ = 10164480480.
The previous prime is 14006437553. The next prime is 14006437597. The reversal of 14006437555 is 55573460041.
14006437555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14006437555 - 21 = 14006437553 is a prime.
It is a super-5 number, since 5×140064375555 (a number of 52 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14006437553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 249549 + ... + 300478.
It is an arithmetic number, because the mean of its divisors is an integer number (1148458464).
Almost surely, 214006437555 is an apocalyptic number.
14006437555 is a deficient number, since it is larger than the sum of its proper divisors (4368897869).
14006437555 is a wasteful number, since it uses less digits than its factorization.
14006437555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550506.
The product of its (nonzero) digits is 252000, while the sum is 40.
Adding to 14006437555 its reverse (55573460041), we get a palindrome (69579897596).
The spelling of 14006437555 in words is "fourteen billion, six million, four hundred thirty-seven thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •