Base | Representation |
---|---|
bin | 100101100100000011011… |
… | …0001000011110001001111 |
3 | 200021112201221112100101021 |
4 | 1023020012301003301033 |
5 | 1134041114014313313 |
6 | 14551410055055011 |
7 | 1041663426522652 |
oct | 113100661036117 |
9 | 20245657470337 |
10 | 5162664213583 |
11 | 17105233a3828 |
12 | 6b4685971467 |
13 | 2b5ab6297916 |
14 | 13bc35055899 |
15 | 8e45d02578d |
hex | 4b206c43c4f |
5162664213583 has 16 divisors (see below), whose sum is σ = 5240345932800. Its totient is φ = 5085122664160.
The previous prime is 5162664213517. The next prime is 5162664213599. The reversal of 5162664213583 is 3853124662615.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5162664213583 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 5162664213583.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5162664273583) 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 15 ways as a sum of consecutive naturals, for example, 651929898 + ... + 651937816.
It is an arithmetic number, because the mean of its divisors is an integer number (327521620800).
Almost surely, 25162664213583 is an apocalyptic number.
5162664213583 is a deficient number, since it is larger than the sum of its proper divisors (77681719217).
5162664213583 is a wasteful number, since it uses less digits than its factorization.
5162664213583 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15542.
The product of its digits is 6220800, while the sum is 52.
The spelling of 5162664213583 in words is "five trillion, one hundred sixty-two billion, six hundred sixty-four million, two hundred thirteen thousand, five hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •