Base | Representation |
---|---|
bin | 10011111001011111011… |
… | …01100111111010000000 |
3 | 2102100202020201021221120 |
4 | 21330233231213322000 |
5 | 42200204233223102 |
6 | 1242030525552240 |
7 | 100252505366436 |
oct | 11745755477200 |
9 | 2370666637846 |
10 | 683700289152 |
11 | 243a56a97691 |
12 | b0609a15680 |
13 | 4c61b58771a |
14 | 2513c636d56 |
15 | 12bb810d6bc |
hex | 9f2fb67e80 |
683700289152 has 128 divisors (see below), whose sum is σ = 1828182312000. Its totient is φ = 226384011264.
The previous prime is 683700289039. The next prime is 683700289163. The reversal of 683700289152 is 251982007386.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 683700289095 and 683700289104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70999474 + ... + 71009102.
Almost surely, 2683700289152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 683700289152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (914091156000).
683700289152 is an abundant number, since it is smaller than the sum of its proper divisors (1144482022848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
683700289152 is a wasteful number, since it uses less digits than its factorization.
683700289152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10858 (or 10846 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 683700289152 in words is "six hundred eighty-three billion, seven hundred million, two hundred eighty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •