Base | Representation |
---|---|
bin | 100100100100110010001… |
… | …001001010011111100101 |
3 | 22220021111222010100022102 |
4 | 210210302021022133211 |
5 | 312134414131144422 |
6 | 5202345543141445 |
7 | 346405216055156 |
oct | 44446211123745 |
9 | 8807458110272 |
10 | 2513397131237 |
11 | 889a2017a273 |
12 | 347143744885 |
13 | 15302112c725 |
14 | 8991309792d |
15 | 455a4d5b192 |
hex | 2493224a7e5 |
2513397131237 has 2 divisors, whose sum is σ = 2513397131238. Its totient is φ = 2513397131236.
The previous prime is 2513397131221. The next prime is 2513397131249. The reversal of 2513397131237 is 7321317933152.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1991572935361 + 521824195876 = 1411231^2 + 722374^2 .
It is a cyclic number.
It is not a de Polignac number, because 2513397131237 - 24 = 2513397131221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2513397131191 and 2513397131200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2513397131737) 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, 1256698565618 + 1256698565619.
It is an arithmetic number, because the mean of its divisors is an integer number (1256698565619).
Almost surely, 22513397131237 is an apocalyptic number.
It is an amenable number.
2513397131237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2513397131237 is an equidigital number, since it uses as much as digits as its factorization.
2513397131237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 714420, while the sum is 47.
The spelling of 2513397131237 in words is "two trillion, five hundred thirteen billion, three hundred ninety-seven million, one hundred thirty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •