Base | Representation |
---|---|
bin | 111010010110010101000011… |
… | …0000111111000100011111101 |
3 | 2111022020110222000020112010021 |
4 | 1310230222012013320203331 |
5 | 1014232430113022313122 |
6 | 5015324122522412141 |
7 | 213051346315150153 |
oct | 16454520607704375 |
9 | 2438213860215107 |
10 | 513242252151037 |
11 | 1395978a9161152 |
12 | 49691953961051 |
13 | 1904c6c91b1676 |
14 | 90a50b3ca53d3 |
15 | 3e5091eab01c7 |
hex | 1d2ca861f88fd |
513242252151037 has 2 divisors, whose sum is σ = 513242252151038. Its totient is φ = 513242252151036.
The previous prime is 513242252151011. The next prime is 513242252151049. The reversal of 513242252151037 is 730151252242315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 389467304225476 + 123774947925561 = 19734926^2 + 11125419^2 .
It is a cyclic number.
It is not a de Polignac number, because 513242252151037 - 235 = 513207892412669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 513242252150984 and 513242252151002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (513242252151067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256621126075518 + 256621126075519.
It is an arithmetic number, because the mean of its divisors is an integer number (256621126075519).
Almost surely, 2513242252151037 is an apocalyptic number.
It is an amenable number.
513242252151037 is a deficient number, since it is larger than the sum of its proper divisors (1).
513242252151037 is an equidigital number, since it uses as much as digits as its factorization.
513242252151037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504000, while the sum is 43.
The spelling of 513242252151037 in words is "five hundred thirteen trillion, two hundred forty-two billion, two hundred fifty-two million, one hundred fifty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •