Base | Representation |
---|---|
bin | 101100110001000011100… |
… | …0111010101010010000101 |
3 | 210210012002110021210021201 |
4 | 1121202013013111102011 |
5 | 1301301121430423323 |
6 | 21030254252542501 |
7 | 1203341436136666 |
oct | 131420707252205 |
9 | 23705073253251 |
10 | 6152660014213 |
11 | 1a623681a6659 |
12 | 834515481a31 |
13 | 358268a3575b |
14 | 173b0c96536d |
15 | aa0a134e8ad |
hex | 598871d5485 |
6152660014213 has 2 divisors, whose sum is σ = 6152660014214. Its totient is φ = 6152660014212.
The previous prime is 6152660014201. The next prime is 6152660014223. The reversal of 6152660014213 is 3124100662516.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4578495826564 + 1574164187649 = 2139742^2 + 1254657^2 .
It is a cyclic number.
It is not a de Polignac number, because 6152660014213 - 221 = 6152657917061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6152660014223) 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, 3076330007106 + 3076330007107.
It is an arithmetic number, because the mean of its divisors is an integer number (3076330007107).
Almost surely, 26152660014213 is an apocalyptic number.
It is an amenable number.
6152660014213 is a deficient number, since it is larger than the sum of its proper divisors (1).
6152660014213 is an equidigital number, since it uses as much as digits as its factorization.
6152660014213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 6152660014213 its reverse (3124100662516), we get a palindrome (9276760676729).
The spelling of 6152660014213 in words is "six trillion, one hundred fifty-two billion, six hundred sixty million, fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •