Base | Representation |
---|---|
bin | 100101010001000000101… |
… | …0110011000100010011011 |
3 | 200010122012001000020121100 |
4 | 1022202001112120202123 |
5 | 1132403341403122441 |
6 | 14520524214442443 |
7 | 1036015156263516 |
oct | 112420126304233 |
9 | 20118161006540 |
10 | 5121771145371 |
11 | 16a5149318391 |
12 | 6a8772963423 |
13 | 2b1c9a1a7b3a |
14 | 139c76013d7d |
15 | 8d367e30cb6 |
hex | 4a88159889b |
5121771145371 has 24 divisors (see below), whose sum is σ = 7419943125504. Its totient is φ = 3404440413360.
The previous prime is 5121771145369. The next prime is 5121771145373. The reversal of 5121771145371 is 1735411771215.
5121771145371 is a `hidden beast` number, since 5 + 12 + 177 + 11 + 453 + 7 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (5121771145369) and next prime (5121771145373).
It is not a de Polignac number, because 5121771145371 - 21 = 5121771145369 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5121771145373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53689806 + ... + 53785116.
It is an arithmetic number, because the mean of its divisors is an integer number (309164296896).
Almost surely, 25121771145371 is an apocalyptic number.
5121771145371 is a deficient number, since it is larger than the sum of its proper divisors (2298171980133).
5121771145371 is a wasteful number, since it uses less digits than its factorization.
5121771145371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112871 (or 112868 counting only the distinct ones).
The product of its digits is 205800, while the sum is 45.
The spelling of 5121771145371 in words is "five trillion, one hundred twenty-one billion, seven hundred seventy-one million, one hundred forty-five thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •