Base | Representation |
---|---|
bin | 100100110100110000101… |
… | …1001010100001101111111 |
3 | 122220211121010220012111221 |
4 | 1021221201121110031333 |
5 | 1130410121002013210 |
6 | 14433012331254211 |
7 | 1031436624644032 |
oct | 111514131241577 |
9 | 18824533805457 |
10 | 5061105501055 |
11 | 168144812695a |
12 | 698a61baa367 |
13 | 2a934c879c96 |
14 | 136d5cdab019 |
15 | 8b9b70451da |
hex | 49a6165437f |
5061105501055 has 8 divisors (see below), whose sum is σ = 6073519514832. Its totient is φ = 4048755791808.
The previous prime is 5061105500951. The next prime is 5061105501113. The reversal of 5061105501055 is 5501055011605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5061105501055 - 223 = 5061097112447 is a prime.
It is a super-2 number, since 2×50611055010552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5061105501055.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15902809 + ... + 16217938.
It is an arithmetic number, because the mean of its divisors is an integer number (759189939354).
Almost surely, 25061105501055 is an apocalyptic number.
5061105501055 is a deficient number, since it is larger than the sum of its proper divisors (1012414013777).
5061105501055 is a wasteful number, since it uses less digits than its factorization.
5061105501055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32152265.
The product of its (nonzero) digits is 18750, while the sum is 34.
It can be divided in two parts, 506110550 and 1055, that added together give a palindrome (506111605).
The spelling of 5061105501055 in words is "five trillion, sixty-one billion, one hundred five million, five hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •