Base | Representation |
---|---|
bin | 10100000110111101001… |
… | …10110011011011000101 |
3 | 2110001102001201022102002 |
4 | 22003132212303123011 |
5 | 42310010421401123 |
6 | 1245224132355045 |
7 | 100626606455633 |
oct | 12033646633305 |
9 | 2401361638362 |
10 | 690929481413 |
11 | 247026752846 |
12 | b1aa6a75a85 |
13 | 502011c9092 |
14 | 256267b4353 |
15 | 12e8caeb528 |
hex | a0de9b36c5 |
690929481413 has 2 divisors, whose sum is σ = 690929481414. Its totient is φ = 690929481412.
The previous prime is 690929481391. The next prime is 690929481433. The reversal of 690929481413 is 314184929096.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 684395507524 + 6533973889 = 827282^2 + 80833^2 .
It is a cyclic number.
It is not a de Polignac number, because 690929481413 - 212 = 690929477317 is a prime.
It is a super-2 number, since 2×6909294814132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (690929481433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345464740706 + 345464740707.
It is an arithmetic number, because the mean of its divisors is an integer number (345464740707).
Almost surely, 2690929481413 is an apocalyptic number.
It is an amenable number.
690929481413 is a deficient number, since it is larger than the sum of its proper divisors (1).
690929481413 is an equidigital number, since it uses as much as digits as its factorization.
690929481413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3359232, while the sum is 56.
The spelling of 690929481413 in words is "six hundred ninety billion, nine hundred twenty-nine million, four hundred eighty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •