Base | Representation |
---|---|
bin | 11110000001010101001… |
… | …00101111101010010001 |
3 | 10122121111110022201112201 |
4 | 33000222210233222101 |
5 | 113400011121122023 |
6 | 2105511214323201 |
7 | 134344455646633 |
oct | 17005244575221 |
9 | 3577443281481 |
10 | 1031506426513 |
11 | 368506539512 |
12 | 147ab54b9501 |
13 | 76369793074 |
14 | 37cd4988a53 |
15 | 1bc72758bad |
hex | f02a92fa91 |
1031506426513 has 2 divisors, whose sum is σ = 1031506426514. Its totient is φ = 1031506426512.
The previous prime is 1031506426469. The next prime is 1031506426519. The reversal of 1031506426513 is 3156246051301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 619885379584 + 411621046929 = 787328^2 + 641577^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031506426513 - 237 = 894067473041 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031506426519) 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, 515753213256 + 515753213257.
It is an arithmetic number, because the mean of its divisors is an integer number (515753213257).
Almost surely, 21031506426513 is an apocalyptic number.
It is an amenable number.
1031506426513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031506426513 is an equidigital number, since it uses as much as digits as its factorization.
1031506426513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 1031506426513 in words is "one trillion, thirty-one billion, five hundred six million, four hundred twenty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •