Base | Representation |
---|---|
bin | 100101110110001010011… |
… | …0110001101100100101111 |
3 | 200102021010022200200020101 |
4 | 1023230110312031210233 |
5 | 1140210241104314101 |
6 | 15021321134531531 |
7 | 1044541246164412 |
oct | 113542466154457 |
9 | 20367108620211 |
10 | 5201555151151 |
11 | 1725a70307847 |
12 | 70011a366ba7 |
13 | 2b9673645608 |
14 | 13da84205b79 |
15 | 90487486401 |
hex | 4bb14d8d92f |
5201555151151 has 8 divisors (see below), whose sum is σ = 5253102741744. Its totient is φ = 5150008483200.
The previous prime is 5201555151127. The next prime is 5201555151197. The reversal of 5201555151151 is 1511515551025.
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 5201555151151 - 229 = 5201018280239 is a prime.
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 5201555151151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5201555154151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19015516 + ... + 19287118.
It is an arithmetic number, because the mean of its divisors is an integer number (656637842718).
Almost surely, 25201555151151 is an apocalyptic number.
5201555151151 is a deficient number, since it is larger than the sum of its proper divisors (51547590593).
5201555151151 is a wasteful number, since it uses less digits than its factorization.
5201555151151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461321.
The product of its (nonzero) digits is 31250, while the sum is 37.
The spelling of 5201555151151 in words is "five trillion, two hundred one billion, five hundred fifty-five million, one hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •