Base | Representation |
---|---|
bin | 1100110001110001… |
… | …10110011101010100 |
3 | 122201002022110211200 |
4 | 12120320312131110 |
5 | 103022130213002 |
6 | 3052413432500 |
7 | 331666046100 |
oct | 63070663524 |
9 | 18632273750 |
10 | 6860007252 |
11 | 2a00327a8a |
12 | 13b549b730 |
13 | 8542cbcb7 |
14 | 491118900 |
15 | 2a23b4b1c |
hex | 198e36754 |
6860007252 has 54 divisors (see below), whose sum is σ = 20171693178. Its totient is φ = 1960001568.
The previous prime is 6860007251. The next prime is 6860007269. The reversal of 6860007252 is 2527000686.
It can be written as a sum of positive squares in only one way, i.e., 5576504976 + 1283502276 = 74676^2 + 35826^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
6860007252 is a modest number, since divided by 7252 gives 6860 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6860007251) 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 17 ways as a sum of consecutive naturals, for example, 1942683 + ... + 1946210.
Almost surely, 26860007252 is an apocalyptic number.
It is an amenable number.
6860007252 is an abundant number, since it is smaller than the sum of its proper divisors (13311685926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6860007252 is a wasteful number, since it uses less digits than its factorization.
6860007252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3888917 (or 3888905 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 6860007252 is about 82825.1607423734. The cubic root of 6860007252 is about 1900.0930011725.
The spelling of 6860007252 in words is "six billion, eight hundred sixty million, seven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •