Base | Representation |
---|---|
bin | 100101001001010000000… |
… | …0100001111110100111101 |
3 | 200002001011122202102100111 |
4 | 1022102200010033310331 |
5 | 1132120224243144423 |
6 | 14505130440030021 |
7 | 1034555205152614 |
oct | 112224004176475 |
9 | 20061148672314 |
10 | 5105106615613 |
11 | 169907765a544 |
12 | 6a54a1a62311 |
13 | 2b0542851344 |
14 | 139134adc87b |
15 | 8cbdee2260d |
hex | 4a4a010fd3d |
5105106615613 has 2 divisors, whose sum is σ = 5105106615614. Its totient is φ = 5105106615612.
The previous prime is 5105106615559. The next prime is 5105106615617. The reversal of 5105106615613 is 3165166015015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5086639708164 + 18466907449 = 2255358^2 + 135893^2 .
It is a cyclic number.
It is not a de Polignac number, because 5105106615613 - 233 = 5096516681021 is a prime.
It is a super-2 number, since 2×51051066156132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5105106615617) 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 as a sum of consecutive naturals, namely, 2552553307806 + 2552553307807.
It is an arithmetic number, because the mean of its divisors is an integer number (2552553307807).
Almost surely, 25105106615613 is an apocalyptic number.
It is an amenable number.
5105106615613 is a deficient number, since it is larger than the sum of its proper divisors (1).
5105106615613 is an equidigital number, since it uses as much as digits as its factorization.
5105106615613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 40.
The spelling of 5105106615613 in words is "five trillion, one hundred five billion, one hundred six million, six hundred fifteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •