Base | Representation |
---|---|
bin | 1100111010010001… |
… | …10100000100100000 |
3 | 122220001110112222112 |
4 | 12131020310010200 |
5 | 103143403110030 |
6 | 3103441454452 |
7 | 333523040405 |
oct | 63510640440 |
9 | 18801415875 |
10 | 6931300640 |
11 | 2a375a1840 |
12 | 1415341428 |
13 | 866001434 |
14 | 49a7962ac |
15 | 2a8798a95 |
hex | 19d234120 |
6931300640 has 96 divisors (see below), whose sum is σ = 17900507520. Its totient is φ = 2515302400.
The previous prime is 6931300609. The next prime is 6931300667. The reversal of 6931300640 is 460031396.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 6931300597 and 6931300606.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 913181 + ... + 920739.
It is an arithmetic number, because the mean of its divisors is an integer number (186463620).
Almost surely, 26931300640 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 6931300640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8950253760).
6931300640 is an abundant number, since it is smaller than the sum of its proper divisors (10969206880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6931300640 is a wasteful number, since it uses less digits than its factorization.
6931300640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8106 (or 8098 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
The square root of 6931300640 is about 83254.4331552380. The cubic root of 6931300640 is about 1906.6526387110.
The spelling of 6931300640 in words is "six billion, nine hundred thirty-one million, three hundred thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •