Base | Representation |
---|---|
bin | 1110101001111100… |
… | …00011101110000010 |
3 | 202022100001002010212 |
4 | 13110332003232002 |
5 | 112103202132000 |
6 | 3340422354122 |
7 | 365655640550 |
oct | 72476035602 |
9 | 22270032125 |
10 | 7868005250 |
11 | 3378313886 |
12 | 1636b8b942 |
13 | 9850a9711 |
14 | 548d48bd0 |
15 | 310b25c35 |
hex | 1d4f83b82 |
7868005250 has 64 divisors (see below), whose sum is σ = 16861478400. Its totient is φ = 2693044800.
The previous prime is 7868005207. The next prime is 7868005307. The reversal of 7868005250 is 525008687.
It is a super-2 number, since 2×78680052502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7868005198 and 7868005207.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1128776 + ... + 1135724.
It is an arithmetic number, because the mean of its divisors is an integer number (263460600).
Almost surely, 27868005250 is an apocalyptic number.
7868005250 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
7868005250 is an abundant number, since it is smaller than the sum of its proper divisors (8993473150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7868005250 is a wasteful number, since it uses less digits than its factorization.
7868005250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7620 (or 7610 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 41.
The square root of 7868005250 is about 88701.7770396963. Note that the first 3 decimals coincide. The cubic root of 7868005250 is about 1988.9393816210.
The spelling of 7868005250 in words is "seven billion, eight hundred sixty-eight million, five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •