Base | Representation |
---|---|
bin | 10100000101001111001… |
… | …11100110100000011101 |
3 | 2102222000202210112200100 |
4 | 22002213213212200131 |
5 | 42301113234200043 |
6 | 1244552415251313 |
7 | 100565005151550 |
oct | 12024747464035 |
9 | 2388022715610 |
10 | 690006943773 |
11 | 2466a2a27644 |
12 | b1889b19b39 |
13 | 500b5041214 |
14 | 2557a06c697 |
15 | 12e36b1bcd3 |
hex | a0a79e681d |
690006943773 has 48 divisors (see below), whose sum is σ = 1193977040256. Its totient is φ = 375726919680.
The previous prime is 690006943771. The next prime is 690006943793. The reversal of 690006943773 is 377349600096.
It is not a de Polignac number, because 690006943773 - 21 = 690006943771 is a prime.
It is a super-2 number, since 2×6900069437732 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (690006943771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2995140 + ... + 3217277.
It is an arithmetic number, because the mean of its divisors is an integer number (24874521672).
Almost surely, 2690006943773 is an apocalyptic number.
690006943773 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
690006943773 is a deficient number, since it is larger than the sum of its proper divisors (503970096483).
690006943773 is a wasteful number, since it uses less digits than its factorization.
690006943773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6212514 (or 6212511 counting only the distinct ones).
The product of its (nonzero) digits is 5143824, while the sum is 54.
The spelling of 690006943773 in words is "six hundred ninety billion, six million, nine hundred forty-three thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •