Base | Representation |
---|---|
bin | 100101100001111110110… |
… | …1000101010100000010001 |
3 | 200021010020221112021001000 |
4 | 1023003331220222200101 |
5 | 1134003011302110310 |
6 | 14545352435332213 |
7 | 1041445255001034 |
oct | 113037550524021 |
9 | 20233227467030 |
10 | 5158216050705 |
11 | 1709650539163 |
12 | 6b3844151069 |
13 | 2b5557870793 |
14 | 13b9323a101b |
15 | 8e29c7764c0 |
hex | 4b0fda2a811 |
5158216050705 has 32 divisors (see below), whose sum is σ = 9242367897600. Its totient is φ = 2729386751616.
The previous prime is 5158216050703. The next prime is 5158216050721. The reversal of 5158216050705 is 5070506128515.
5158216050705 is a `hidden beast` number, since 5 + 1 + 5 + 82 + 1 + 60 + 507 + 0 + 5 = 666.
It is not a de Polignac number, because 5158216050705 - 21 = 5158216050703 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (5158216050703) 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 31 ways as a sum of consecutive naturals, for example, 150412020 + ... + 150446309.
It is an arithmetic number, because the mean of its divisors is an integer number (288823996800).
Almost surely, 25158216050705 is an apocalyptic number.
It is an amenable number.
5158216050705 is a deficient number, since it is larger than the sum of its proper divisors (4084151846895).
5158216050705 is a wasteful number, since it uses less digits than its factorization.
5158216050705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300858470 (or 300858464 counting only the distinct ones).
The product of its (nonzero) digits is 420000, while the sum is 45.
The spelling of 5158216050705 in words is "five trillion, one hundred fifty-eight billion, two hundred sixteen million, fifty thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •