Base | Representation |
---|---|
bin | 11001001111100101010011… |
… | …01111001101101110100000 |
3 | 21021112210121101110002001101 |
4 | 30213302221233031232200 |
5 | 24233443014243410000 |
6 | 314021223105444144 |
7 | 14456352311501650 |
oct | 1447625157155640 |
9 | 237483541402041 |
10 | 55511005060000 |
11 | 167620a3207556 |
12 | 62864a3340654 |
13 | 24c8885911819 |
14 | d9ca65a00360 |
15 | 663e7e202e6a |
hex | 327ca9bcdba0 |
55511005060000 has 120 divisors (see below), whose sum is σ = 156074742220320. Its totient is φ = 19032344544000.
The previous prime is 55511005059947. The next prime is 55511005060001. The reversal of 55511005060000 is 6050011555.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (55511005060001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 198113590 + ... + 198393589.
It is an arithmetic number, because the mean of its divisors is an integer number (1300622851836).
Almost surely, 255511005060000 is an apocalyptic number.
55511005060000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55511005060000 is an abundant number, since it is smaller than the sum of its proper divisors (100563737160320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55511005060000 is an equidigital number, since it uses as much as digits as its factorization.
55511005060000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396507216 (or 396507193 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 55511005060000 its reverse (6050011555), we get a palindrome (55517055071555).
The spelling of 55511005060000 in words is "fifty-five trillion, five hundred eleven billion, five million, sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •