Base | Representation |
---|---|
bin | 100101100010110110111… |
… | …1101010001011010001101 |
3 | 200021022010021110021001022 |
4 | 1023011231331101122031 |
5 | 1134020341212014013 |
6 | 14550303433523525 |
7 | 1041543046365434 |
oct | 113055575213215 |
9 | 20238107407038 |
10 | 5160100501133 |
11 | 170a428233706 |
12 | 6b408b2735a5 |
13 | 2b57980bb7c6 |
14 | 13ba7077c11b |
15 | 8e35ce12008 |
hex | 4b16df5168d |
5160100501133 has 2 divisors, whose sum is σ = 5160100501134. Its totient is φ = 5160100501132.
The previous prime is 5160100501027. The next prime is 5160100501141. The reversal of 5160100501133 is 3311050010615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5049719076964 + 110381424169 = 2247158^2 + 332237^2 .
It is a cyclic number.
It is not a de Polignac number, because 5160100501133 - 210 = 5160100500109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5160100501163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580050250566 + 2580050250567.
It is an arithmetic number, because the mean of its divisors is an integer number (2580050250567).
Almost surely, 25160100501133 is an apocalyptic number.
It is an amenable number.
5160100501133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160100501133 is an equidigital number, since it uses as much as digits as its factorization.
5160100501133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 26.
Adding to 5160100501133 its reverse (3311050010615), we get a palindrome (8471150511748).
The spelling of 5160100501133 in words is "five trillion, one hundred sixty billion, one hundred million, five hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •