Base | Representation |
---|---|
bin | 100000110100111000… |
… | …0001111111010100001 |
3 | 20201221211101122112222 |
4 | 1001221300033322201 |
5 | 2123332343420023 |
6 | 52215005200425 |
7 | 5043620561021 |
oct | 1015160177241 |
9 | 221854348488 |
10 | 70493732513 |
11 | 27994968676 |
12 | 117b4260115 |
13 | 6855816a79 |
14 | 35aa419a81 |
15 | 1c78b3bcc8 |
hex | 1069c0fea1 |
70493732513 has 2 divisors, whose sum is σ = 70493732514. Its totient is φ = 70493732512.
The previous prime is 70493732483. The next prime is 70493732599. The reversal of 70493732513 is 31523739407.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54032072704 + 16461659809 = 232448^2 + 128303^2 .
It is an emirp because it is prime and its reverse (31523739407) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70493732513 - 216 = 70493666977 is a prime.
It is a super-2 number, since 2×704937325132 (a number of 22 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 (70493734513) 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, 35246866256 + 35246866257.
It is an arithmetic number, because the mean of its divisors is an integer number (35246866257).
Almost surely, 270493732513 is an apocalyptic number.
It is an amenable number.
70493732513 is a deficient number, since it is larger than the sum of its proper divisors (1).
70493732513 is an equidigital number, since it uses as much as digits as its factorization.
70493732513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 476280, while the sum is 44.
The spelling of 70493732513 in words is "seventy billion, four hundred ninety-three million, seven hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •