Base | Representation |
---|---|
bin | 101100011111100110001… |
… | …1100111111101011101111 |
3 | 210122121022121121101100002 |
4 | 1120333030130333223233 |
5 | 1300142331131141101 |
6 | 21001134130054515 |
7 | 1200543402406361 |
oct | 130771434775357 |
9 | 23577277541302 |
10 | 6115168615151 |
11 | 1a48479296632 |
12 | 8291b171a43b |
13 | 35487260445b |
14 | 171d93606d31 |
15 | a9109be1d6b |
hex | 58fcc73faef |
6115168615151 has 2 divisors, whose sum is σ = 6115168615152. Its totient is φ = 6115168615150.
The previous prime is 6115168615109. The next prime is 6115168615163. The reversal of 6115168615151 is 1515168615116.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6115168615151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6115168615096 and 6115168615105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6115168675151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3057584307575 + 3057584307576.
It is an arithmetic number, because the mean of its divisors is an integer number (3057584307576).
Almost surely, 26115168615151 is an apocalyptic number.
6115168615151 is a deficient number, since it is larger than the sum of its proper divisors (1).
6115168615151 is an equidigital number, since it uses as much as digits as its factorization.
6115168615151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216000, while the sum is 47.
The spelling of 6115168615151 in words is "six trillion, one hundred fifteen billion, one hundred sixty-eight million, six hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •