Base | Representation |
---|---|
bin | 100100100010010101111… |
… | …0101111100110101110111 |
3 | 122210001111121122001001022 |
4 | 1021010223311330311313 |
5 | 1124233114344112101 |
6 | 14402511433451355 |
7 | 1025536514363555 |
oct | 111045365746567 |
9 | 18701447561038 |
10 | 5021552332151 |
11 | 16666a041a713 |
12 | 691263870b5b |
13 | 2a56b8254c24 |
14 | 135089cb4bd5 |
15 | 8a94e8c2a1b |
hex | 4912bd7cd77 |
5021552332151 has 4 divisors (see below), whose sum is σ = 5316937763472. Its totient is φ = 4726166900832.
The previous prime is 5021552332129. The next prime is 5021552332177. The reversal of 5021552332151 is 1512332551205.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5021552332151 - 26 = 5021552332087 is a prime.
It is a super-2 number, since 2×50215523321512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5021552331151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147692715635 + ... + 147692715668.
It is an arithmetic number, because the mean of its divisors is an integer number (1329234440868).
Almost surely, 25021552332151 is an apocalyptic number.
5021552332151 is a deficient number, since it is larger than the sum of its proper divisors (295385431321).
5021552332151 is a wasteful number, since it uses less digits than its factorization.
5021552332151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295385431320.
The product of its (nonzero) digits is 45000, while the sum is 35.
Adding to 5021552332151 its reverse (1512332551205), we get a palindrome (6533884883356).
The spelling of 5021552332151 in words is "five trillion, twenty-one billion, five hundred fifty-two million, three hundred thirty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •