Base | Representation |
---|---|
bin | 110011001110010000… |
… | …100010100100011111 |
3 | 12020222001022000201002 |
4 | 303032100202210133 |
5 | 1400120003044301 |
6 | 41133333540515 |
7 | 3654644465600 |
oct | 631620424437 |
9 | 166861260632 |
10 | 55000049951 |
11 | 21364104640 |
12 | a7ab4a473b |
13 | 5256918272 |
14 | 293a805da7 |
15 | 166d80b16b |
hex | cce42291f |
55000049951 has 24 divisors (see below), whose sum is σ = 69811710336. Its totient is φ = 42847524720.
The previous prime is 55000049903. The next prime is 55000050011. The reversal of 55000049951 is 15994000055.
It is not a de Polignac number, because 55000049951 - 218 = 54999787807 is a prime.
It is a super-2 number, since 2×550000499512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55000049551) 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 23 ways as a sum of consecutive naturals, for example, 3229280 + ... + 3246266.
It is an arithmetic number, because the mean of its divisors is an integer number (2908821264).
Almost surely, 255000049951 is an apocalyptic number.
55000049951 is a deficient number, since it is larger than the sum of its proper divisors (14811660385).
55000049951 is a wasteful number, since it uses less digits than its factorization.
55000049951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23019 (or 23012 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 38.
The spelling of 55000049951 in words is "fifty-five billion, forty-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •