Base | Representation |
---|---|
bin | 110011011100111000… |
… | …011111010000010000 |
3 | 12021121010222021000200 |
4 | 303130320133100100 |
5 | 1401120310400102 |
6 | 41213540415200 |
7 | 3664014115212 |
oct | 633470372020 |
9 | 167533867020 |
10 | 55245403152 |
11 | 2147a654085 |
12 | a8596a7500 |
13 | 52956c1884 |
14 | 29612325b2 |
15 | 168512351c |
hex | cdce1f410 |
55245403152 has 120 divisors (see below), whose sum is σ = 157461630144. Its totient is φ = 18077444352.
The previous prime is 55245403151. The next prime is 55245403189. The reversal of 55245403152 is 25130454255.
55245403152 is a `hidden beast` number, since 5 + 5 + 245 + 403 + 1 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (55245403151) 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, 2817093 + ... + 2836635.
Almost surely, 255245403152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55245403152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78730815072).
55245403152 is an abundant number, since it is smaller than the sum of its proper divisors (102216226992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55245403152 is a wasteful number, since it uses less digits than its factorization.
55245403152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19917 (or 19908 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
The spelling of 55245403152 in words is "fifty-five billion, two hundred forty-five million, four hundred three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •