Base | Representation |
---|---|
bin | 10100000011010110000… |
… | …00101100000111001001 |
3 | 2102212101220110001011220 |
4 | 22001223000230013021 |
5 | 42242022432011103 |
6 | 1244303453112253 |
7 | 100530550210212 |
oct | 12015300540711 |
9 | 2385356401156 |
10 | 688990110153 |
11 | 246220a56484 |
12 | b1645488689 |
13 | 4cc8248bc17 |
14 | 254c0dbc409 |
15 | 12dc7712c53 |
hex | a06b02c1c9 |
688990110153 has 16 divisors (see below), whose sum is σ = 996416116416. Its totient is φ = 421763432960.
The previous prime is 688990110077. The next prime is 688990110197. The reversal of 688990110153 is 351011099886.
It is a cyclic number.
It is not a de Polignac number, because 688990110153 - 229 = 688453239241 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 688990110096 and 688990110105.
It is not an unprimeable number, because it can be changed into a prime (688990110553) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164749251 + ... + 164753432.
It is an arithmetic number, because the mean of its divisors is an integer number (62276007276).
Almost surely, 2688990110153 is an apocalyptic number.
It is an amenable number.
688990110153 is a deficient number, since it is larger than the sum of its proper divisors (307426006263).
688990110153 is a wasteful number, since it uses less digits than its factorization.
688990110153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329502744.
The product of its (nonzero) digits is 466560, while the sum is 51.
The spelling of 688990110153 in words is "six hundred eighty-eight billion, nine hundred ninety million, one hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •