Base | Representation |
---|---|
bin | 101111011010100000010… |
… | …1011110000010111010111 |
3 | 212001222100121121212100112 |
4 | 1132311000223300113113 |
5 | 1323231343423201101 |
6 | 21505354555033235 |
7 | 1241543125112234 |
oct | 136650053602727 |
9 | 25058317555315 |
10 | 6516550600151 |
11 | 2092720a22799 |
12 | 892b4b73b81b |
13 | 38367b3544a7 |
14 | 18758d14c78b |
15 | b479cac26bb |
hex | 5ed40af05d7 |
6516550600151 has 2 divisors, whose sum is σ = 6516550600152. Its totient is φ = 6516550600150.
The previous prime is 6516550600121. The next prime is 6516550600171. The reversal of 6516550600151 is 1510060556156.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6516550600151 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 6516550600099 and 6516550600108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6516550600121) 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, 3258275300075 + 3258275300076.
It is an arithmetic number, because the mean of its divisors is an integer number (3258275300076).
Almost surely, 26516550600151 is an apocalyptic number.
6516550600151 is a deficient number, since it is larger than the sum of its proper divisors (1).
6516550600151 is an equidigital number, since it uses as much as digits as its factorization.
6516550600151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 6516550600151 in words is "six trillion, five hundred sixteen billion, five hundred fifty million, six hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •