Base | Representation |
---|---|
bin | 11011000111001000… |
… | …01100110101110111 |
3 | 1101120101102200102120 |
4 | 31203210030311313 |
5 | 214302131223210 |
6 | 10404151211023 |
7 | 1023460213041 |
oct | 154344146567 |
9 | 41511380376 |
10 | 14555336055 |
11 | 619a120457 |
12 | 29a2676a73 |
13 | 14ac69a0b0 |
14 | 9c1154a91 |
15 | 5a2c7c270 |
hex | 36390cd77 |
14555336055 has 32 divisors (see below), whose sum is σ = 25143271104. Its totient is φ = 7147616256.
The previous prime is 14555336009. The next prime is 14555336083. The reversal of 14555336055 is 55063355541.
It is not a de Polignac number, because 14555336055 - 210 = 14555335031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14555335998 and 14555336016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16594 + ... + 171423.
It is an arithmetic number, because the mean of its divisors is an integer number (785727222).
Almost surely, 214555336055 is an apocalyptic number.
14555336055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14555336055 is a deficient number, since it is larger than the sum of its proper divisors (10587935049).
14555336055 is a wasteful number, since it uses less digits than its factorization.
14555336055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188435.
The product of its (nonzero) digits is 675000, while the sum is 42.
The spelling of 14555336055 in words is "fourteen billion, five hundred fifty-five million, three hundred thirty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •