Base | Representation |
---|---|
bin | 100101001011100110010… |
… | …1111111010000011010001 |
3 | 200002112012020002011020200 |
4 | 1022113030233322003101 |
5 | 1132211042203204203 |
6 | 14511323203325413 |
7 | 1035124211505333 |
oct | 112271457720321 |
9 | 20075166064220 |
10 | 5110151225553 |
11 | 16a0226166670 |
12 | 6a646b380869 |
13 | 2b0b679cbb3a |
14 | 139492a93453 |
15 | 8cdd7c3b9a3 |
hex | 4a5ccbfa0d1 |
5110151225553 has 24 divisors (see below), whose sum is σ = 8078251386816. Its totient is φ = 3087102933600.
The previous prime is 5110151225549. The next prime is 5110151225567. The reversal of 5110151225553 is 3555221510115.
5110151225553 is a `hidden beast` number, since 5 + 110 + 1 + 512 + 25 + 5 + 5 + 3 = 666.
It is not a de Polignac number, because 5110151225553 - 22 = 5110151225549 is a prime.
It is a super-2 number, since 2×51101512255532 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5110151225953) 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, 82955850 + ... + 83017427.
It is an arithmetic number, because the mean of its divisors is an integer number (336593807784).
Almost surely, 25110151225553 is an apocalyptic number.
It is an amenable number.
5110151225553 is a deficient number, since it is larger than the sum of its proper divisors (2968100161263).
5110151225553 is a wasteful number, since it uses less digits than its factorization.
5110151225553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165973605 (or 165973602 counting only the distinct ones).
The product of its (nonzero) digits is 37500, while the sum is 36.
Adding to 5110151225553 its reverse (3555221510115), we get a palindrome (8665372735668).
The spelling of 5110151225553 in words is "five trillion, one hundred ten billion, one hundred fifty-one million, two hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •