Base | Representation |
---|---|
bin | 100110101101100000101… |
… | …0001001100010110000111 |
3 | 200211121220122212022112201 |
4 | 1031123001101030112013 |
5 | 1144132200434202101 |
6 | 15152055154055331 |
7 | 1056246525004252 |
oct | 115330121142607 |
9 | 20747818768481 |
10 | 5320412022151 |
11 | 177141297a156 |
12 | 71b16b27a547 |
13 | 2c7935a5b195 |
14 | 14571b7c4099 |
15 | 935e1dd6e01 |
hex | 4d6c144c587 |
5320412022151 has 4 divisors (see below), whose sum is σ = 5320684869304. Its totient is φ = 5320139175000.
The previous prime is 5320412022143. The next prime is 5320412022193. The reversal of 5320412022151 is 1512202140235.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5320412022151 - 23 = 5320412022143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5320412022131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136394325 + ... + 136433326.
It is an arithmetic number, because the mean of its divisors is an integer number (1330171217326).
Almost surely, 25320412022151 is an apocalyptic number.
5320412022151 is a deficient number, since it is larger than the sum of its proper divisors (272847153).
5320412022151 is a wasteful number, since it uses less digits than its factorization.
5320412022151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272847152.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 5320412022151 its reverse (1512202140235), we get a palindrome (6832614162386).
The spelling of 5320412022151 in words is "five trillion, three hundred twenty billion, four hundred twelve million, twenty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •