Base | Representation |
---|---|
bin | 10100000110001011100… |
… | …11000000001101011001 |
3 | 2110000100001111112000222 |
4 | 22003011303000031121 |
5 | 42303132342432423 |
6 | 1245114543205425 |
7 | 100613363526452 |
oct | 12030563001531 |
9 | 2400301445028 |
10 | 690513249113 |
11 | 246932800306 |
12 | b19ab5a6875 |
13 | 50165bc328c |
14 | 255c73c6129 |
15 | 12e662cd3c8 |
hex | a0c5cc0359 |
690513249113 has 2 divisors, whose sum is σ = 690513249114. Its totient is φ = 690513249112.
The previous prime is 690513249103. The next prime is 690513249149. The reversal of 690513249113 is 311942315096.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 672985607449 + 17527641664 = 820357^2 + 132392^2 .
It is a cyclic number.
It is not a de Polignac number, because 690513249113 - 220 = 690512200537 is a prime.
It is a super-3 number, since 3×6905132491133 (a number of 36 digits) contains 333 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 (690513249103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345256624556 + 345256624557.
It is an arithmetic number, because the mean of its divisors is an integer number (345256624557).
Almost surely, 2690513249113 is an apocalyptic number.
It is an amenable number.
690513249113 is a deficient number, since it is larger than the sum of its proper divisors (1).
690513249113 is an equidigital number, since it uses as much as digits as its factorization.
690513249113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 174960, while the sum is 44.
The spelling of 690513249113 in words is "six hundred ninety billion, five hundred thirteen million, two hundred forty-nine thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •