Base | Representation |
---|---|
bin | 11001000000110101100011… |
… | …00011010000001011111110 |
3 | 21012202100210022221020111000 |
4 | 30200122301203100023332 |
5 | 24202142331440014100 |
6 | 312552350152511130 |
7 | 14404634400531315 |
oct | 1440326143201376 |
9 | 235670708836430 |
10 | 55004330001150 |
11 | 165872293645a2 |
12 | 620425a9ab4a6 |
13 | 248cb698ac0aa |
14 | d8231c08727c |
15 | 655bc758e900 |
hex | 3206b18d02fe |
55004330001150 has 96 divisors (see below), whose sum is σ = 151585059765600. Its totient is φ = 14666120755200.
The previous prime is 55004330001077. The next prime is 55004330001151. The reversal of 55004330001150 is 5110003340055.
55004330001150 is a `hidden beast` number, since 5 + 500 + 4 + 3 + 3 + 0 + 0 + 0 + 1 + 150 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55004330001151) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9307756 + ... + 14022944.
It is an arithmetic number, because the mean of its divisors is an integer number (1579011039225).
Almost surely, 255004330001150 is an apocalyptic number.
55004330001150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55004330001150 is an abundant number, since it is smaller than the sum of its proper divisors (96580729764450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55004330001150 is a wasteful number, since it uses less digits than its factorization.
55004330001150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4723851 (or 4723840 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 55004330001150 in words is "fifty-five trillion, four billion, three hundred thirty million, one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •