Base | Representation |
---|---|
bin | 10100000110001101101… |
… | …11011011000110011101 |
3 | 2110000101022020202112001 |
4 | 22003012313123012131 |
5 | 42303201440410203 |
6 | 1245120423442301 |
7 | 100614002141023 |
oct | 12030667330635 |
9 | 2400338222461 |
10 | 690531185053 |
11 | 2469419408a6 |
12 | b19b55b6391 |
13 | 50169833068 |
14 | 255c9934713 |
15 | 12e67b7291d |
hex | a0c6ddb19d |
690531185053 has 2 divisors, whose sum is σ = 690531185054. Its totient is φ = 690531185052.
The previous prime is 690531184997. The next prime is 690531185063. The reversal of 690531185053 is 350581135096.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 504288877689 + 186242307364 = 710133^2 + 431558^2 .
It is a cyclic number.
It is not a de Polignac number, because 690531185053 - 213 = 690531176861 is a prime.
It is a super-2 number, since 2×6905311850532 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 690531184994 and 690531185012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (690531185063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345265592526 + 345265592527.
It is an arithmetic number, because the mean of its divisors is an integer number (345265592527).
Almost surely, 2690531185053 is an apocalyptic number.
It is an amenable number.
690531185053 is a deficient number, since it is larger than the sum of its proper divisors (1).
690531185053 is an equidigital number, since it uses as much as digits as its factorization.
690531185053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 46.
The spelling of 690531185053 in words is "six hundred ninety billion, five hundred thirty-one million, one hundred eighty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •