Base | Representation |
---|---|
bin | 110011110010101011… |
… | …101011101110111010 |
3 | 12022112122011212201110 |
4 | 303302223223232322 |
5 | 1402342423121041 |
6 | 41314123501150 |
7 | 4006044635334 |
oct | 636253535672 |
9 | 168478155643 |
10 | 55611145146 |
11 | 21648050497 |
12 | a9400877b6 |
13 | 53233ca05b |
14 | 2997a3a454 |
15 | 16a72bb516 |
hex | cf2aebbba |
55611145146 has 8 divisors (see below), whose sum is σ = 111222290304. Its totient is φ = 18537048380.
The previous prime is 55611145067. The next prime is 55611145147. The reversal of 55611145146 is 64154111655.
It is a sphenic number, since it is the product of 3 distinct primes.
55611145146 is an admirable number.
It is a super-2 number, since 2×556111451462 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (55611145147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4634262090 + ... + 4634262101.
It is an arithmetic number, because the mean of its divisors is an integer number (13902786288).
Almost surely, 255611145146 is an apocalyptic number.
55611145146 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55611145146 is a wasteful number, since it uses less digits than its factorization.
55611145146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9268524196.
The product of its digits is 72000, while the sum is 39.
The spelling of 55611145146 in words is "fifty-five billion, six hundred eleven million, one hundred forty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •