Base | Representation |
---|---|
bin | 110011101100001001… |
… | …000101011100110111 |
3 | 12022020222200212100110 |
4 | 303230021011130313 |
5 | 1402131330142101 |
6 | 41255203514103 |
7 | 4003243135143 |
oct | 635411053467 |
9 | 168228625313 |
10 | 55501412151 |
11 | 215a1111469 |
12 | a90b388933 |
13 | 53067593a3 |
14 | 2987234223 |
15 | 169c842cd6 |
hex | cec245737 |
55501412151 has 24 divisors (see below), whose sum is σ = 74850459264. Its totient is φ = 36580739680.
The previous prime is 55501412147. The next prime is 55501412177. The reversal of 55501412151 is 15121410555.
It is not a de Polignac number, because 55501412151 - 22 = 55501412147 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55501412051) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 15117046 + ... + 15120716.
It is an arithmetic number, because the mean of its divisors is an integer number (3118769136).
Almost surely, 255501412151 is an apocalyptic number.
55501412151 is a deficient number, since it is larger than the sum of its proper divisors (19349047113).
55501412151 is a wasteful number, since it uses less digits than its factorization.
55501412151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4199 (or 4050 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 30.
The spelling of 55501412151 in words is "fifty-five billion, five hundred one million, four hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •