Base | Representation |
---|---|
bin | 10100000101111011100… |
… | …10011001100100001000 |
3 | 2102222222200122111210110 |
4 | 22002331302121210020 |
5 | 42302343442414341 |
6 | 1245053343114320 |
7 | 100610142411603 |
oct | 12027562314410 |
9 | 2388880574713 |
10 | 690378873096 |
11 | 24687396a650 |
12 | b19725a29a0 |
13 | 50144104a43 |
14 | 255b360733a |
15 | 12e595d8216 |
hex | a0bdc99908 |
690378873096 has 64 divisors (see below), whose sum is σ = 1883133619200. Its totient is φ = 209174369600.
The previous prime is 690378873053. The next prime is 690378873109.
It is a happy number.
690378873096 is nontrivially palindromic in base 10.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1600285 + ... + 1985363.
It is an arithmetic number, because the mean of its divisors is an integer number (29423962800).
Almost surely, 2690378873096 is an apocalyptic number.
690378873096 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
690378873096 is an abundant number, since it is smaller than the sum of its proper divisors (1192754746104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690378873096 is a wasteful number, since it uses less digits than its factorization.
690378873096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391890 (or 391886 counting only the distinct ones).
The product of its (nonzero) digits is 82301184, while the sum is 66.
The spelling of 690378873096 in words is "six hundred ninety billion, three hundred seventy-eight million, eight hundred seventy-three thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •