Base | Representation |
---|---|
bin | 100100110000000011100… |
… | …1000000111000011011111 |
3 | 122212212111221200210012022 |
4 | 1021200013020013003133 |
5 | 1130223422240403110 |
6 | 14424221535130355 |
7 | 1030631342005160 |
oct | 111400710070337 |
9 | 18785457623168 |
10 | 5051001106655 |
11 | 1678132499889 |
12 | 696b020739bb |
13 | 2a83cc36aa9a |
14 | 136681031767 |
15 | 8b5c4e15755 |
hex | 498072070df |
5051001106655 has 8 divisors (see below), whose sum is σ = 6927087232032. Its totient is φ = 3463543615968.
The previous prime is 5051001106631. The next prime is 5051001106667. The reversal of 5051001106655 is 5566011001505.
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 5051001106655 - 28 = 5051001106399 is a prime.
It is a super-2 number, since 2×50510011066552 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 144314317333 = 5051001106655 / (5 + 0 + 5 + 1 + 0 + 0 + 1 + 1 + 0 + 6 + 6 + 5 + 5).
It is a Duffinian number.
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, 72157158632 + ... + 72157158701.
It is an arithmetic number, because the mean of its divisors is an integer number (865885904004).
Almost surely, 25051001106655 is an apocalyptic number.
5051001106655 is a deficient number, since it is larger than the sum of its proper divisors (1876086125377).
5051001106655 is a wasteful number, since it uses less digits than its factorization.
5051001106655 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144314317345.
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 5051001106655 in words is "five trillion, fifty-one billion, one million, one hundred six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •