Base | Representation |
---|---|
bin | 1101010010100100… |
… | …10111011101010001 |
3 | 200102021000020022122 |
4 | 12221102113131101 |
5 | 104103043201343 |
6 | 3140002344025 |
7 | 341546421401 |
oct | 65122273521 |
9 | 20367006278 |
10 | 7135131473 |
11 | 3031660978 |
12 | 147165b015 |
13 | 8992ca2b2 |
14 | 4b9894801 |
15 | 2bb60d068 |
hex | 1a9497751 |
7135131473 has 2 divisors, whose sum is σ = 7135131474. Its totient is φ = 7135131472.
The previous prime is 7135131431. The next prime is 7135131481. The reversal of 7135131473 is 3741315317.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6991802689 + 143328784 = 83617^2 + 11972^2 .
It is a cyclic number.
It is not a de Polignac number, because 7135131473 - 220 = 7134082897 is a prime.
It is a super-2 number, since 2×71351314732 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (7135131373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3567565736 + 3567565737.
It is an arithmetic number, because the mean of its divisors is an integer number (3567565737).
Almost surely, 27135131473 is an apocalyptic number.
It is an amenable number.
7135131473 is a deficient number, since it is larger than the sum of its proper divisors (1).
7135131473 is an equidigital number, since it uses as much as digits as its factorization.
7135131473 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 26460, while the sum is 35.
The square root of 7135131473 is about 84469.7074281662. The cubic root of 7135131473 is about 1925.1622035019.
The spelling of 7135131473 in words is "seven billion, one hundred thirty-five million, one hundred thirty-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •