Base | Representation |
---|---|
bin | 10100000101110110001… |
… | …11111011000101001000 |
3 | 2102222212120120001112120 |
4 | 22002323013323011020 |
5 | 42302301022340002 |
6 | 1245045105211240 |
7 | 100606060513143 |
oct | 12027307730510 |
9 | 2388776501476 |
10 | 690334183752 |
11 | 246850716904 |
12 | b195b630b20 |
13 | 50137a88945 |
14 | 255ab6d305a |
15 | 12e5570bcbc |
hex | a0bb1fb148 |
690334183752 has 32 divisors (see below), whose sum is σ = 1754127847680. Its totient is φ = 226339076160.
The previous prime is 690334183727. The next prime is 690334183811. The reversal of 690334183752 is 257381433096.
It is a super-2 number, since 2×6903341837522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 690334183695 and 690334183704.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 235768408 + ... + 235771335.
It is an arithmetic number, because the mean of its divisors is an integer number (54816495240).
It is a 1-persistent number, because it is pandigital, but 2⋅690334183752 = 1380668367504 is not.
Almost surely, 2690334183752 is an apocalyptic number.
It is an amenable number.
690334183752 is an abundant number, since it is smaller than the sum of its proper divisors (1063793663928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690334183752 is a wasteful number, since it uses less digits than its factorization.
690334183752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471539813 (or 471539809 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 690334183752 in words is "six hundred ninety billion, three hundred thirty-four million, one hundred eighty-three thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •