Base | Representation |
---|---|
bin | 11001000100010010100110… |
… | …00101000111000000010000 |
3 | 21020011201002221020101002210 |
4 | 30202021103011013000100 |
5 | 24211113403024001300 |
6 | 313123054123112120 |
7 | 14416335300122214 |
oct | 1442112305070020 |
9 | 236151087211083 |
10 | 55123004125200 |
11 | 16622597858470 |
12 | 622325a672640 |
13 | 249b10019b67b |
14 | d87d79294944 |
15 | 658d20e43050 |
hex | 322253147010 |
55123004125200 has 120 divisors (see below), whose sum is σ = 192629843552736. Its totient is φ = 13363152512000.
The previous prime is 55123004125159. The next prime is 55123004125207. The reversal of 55123004125200 is 252140032155.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (55123004125207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2087979381 + ... + 2088005780.
Almost surely, 255123004125200 is an apocalyptic number.
55123004125200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55123004125200 is an abundant number, since it is smaller than the sum of its proper divisors (137506839427536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55123004125200 is a wasteful number, since it uses less digits than its factorization.
55123004125200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4175985193 (or 4175985182 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 55123004125200 its reverse (252140032155), we get a palindrome (55375144157355).
The spelling of 55123004125200 in words is "fifty-five trillion, one hundred twenty-three billion, four million, one hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •