Base | Representation |
---|---|
bin | 1100110101110101… |
… | …00110110001001100 |
3 | 122210110022120220100 |
4 | 12122322212301030 |
5 | 103104332143313 |
6 | 3100030451100 |
7 | 332561134440 |
oct | 63272466114 |
9 | 18713276810 |
10 | 6894021708 |
11 | 2a1854a602 |
12 | 1404963a90 |
13 | 85b37b2b2 |
14 | 495850820 |
15 | 2a5383173 |
hex | 19aea6c4c |
6894021708 has 72 divisors (see below), whose sum is σ = 20001709728. Its totient is φ = 1961250048.
The previous prime is 6894021703. The next prime is 6894021737. The reversal of 6894021708 is 8071204986.
It is not an unprimeable number, because it can be changed into a prime (6894021703) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 10 + ... + 117422.
It is an arithmetic number, because the mean of its divisors is an integer number (277801524).
Almost surely, 26894021708 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 6894021708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10000854864).
6894021708 is an abundant number, since it is smaller than the sum of its proper divisors (13107688020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6894021708 is a wasteful number, since it uses less digits than its factorization.
6894021708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117663 (or 117658 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The square root of 6894021708 is about 83030.2457421391. The cubic root of 6894021708 is about 1903.2282797923.
The spelling of 6894021708 in words is "six billion, eight hundred ninety-four million, twenty-one thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •