Base | Representation |
---|---|
bin | 1101000110100011… |
… | …01010001000010001 |
3 | 200011020020120112222 |
4 | 12203101222020101 |
5 | 103401234020023 |
6 | 3122001030425 |
7 | 336213262166 |
oct | 64321521021 |
9 | 20136216488 |
10 | 7034282513 |
11 | 2a8a73a625 |
12 | 1443925415 |
13 | 88144a25b |
14 | 4aa32206d |
15 | 2b283bcc8 |
hex | 1a346a211 |
7034282513 has 2 divisors, whose sum is σ = 7034282514. Its totient is φ = 7034282512.
The previous prime is 7034282449. The next prime is 7034282537. The reversal of 7034282513 is 3152824307.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7016910289 + 17372224 = 83767^2 + 4168^2 .
It is an emirp because it is prime and its reverse (3152824307) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7034282513 - 26 = 7034282449 is a prime.
It is a super-2 number, since 2×70342825132 = 98962260945395190338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (7034282573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3517141256 + 3517141257.
It is an arithmetic number, because the mean of its divisors is an integer number (3517141257).
Almost surely, 27034282513 is an apocalyptic number.
It is an amenable number.
7034282513 is a deficient number, since it is larger than the sum of its proper divisors (1).
7034282513 is an equidigital number, since it uses as much as digits as its factorization.
7034282513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 35.
The square root of 7034282513 is about 83870.6296208631. The cubic root of 7034282513 is about 1916.0489598653.
The spelling of 7034282513 in words is "seven billion, thirty-four million, two hundred eighty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •