Base | Representation |
---|---|
bin | 1101000011010000… |
… | …11110000100101000 |
3 | 200002022100122110000 |
4 | 12201220132010220 |
5 | 103322204124013 |
6 | 3115134023000 |
7 | 335430015066 |
oct | 64150360450 |
9 | 20068318400 |
10 | 7006708008 |
11 | 2a76116483 |
12 | 1436647a60 |
13 | 878814291 |
14 | 4a67c5036 |
15 | 2b01e1973 |
hex | 1a1a1e128 |
7006708008 has 40 divisors (see below), whose sum is σ = 19625271930. Its totient is φ = 2335569120.
The previous prime is 7006708003. The next prime is 7006708013. The reversal of 7006708008 is 8008076007.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (7006708003) and next prime (7006708013).
It can be written as a sum of positive squares in only one way, i.e., 4950811044 + 2055896964 = 70362^2 + 45342^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (7006708003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5405763 + ... + 5407058.
Almost surely, 27006708008 is an apocalyptic number.
It is an amenable number.
7006708008 is an abundant number, since it is smaller than the sum of its proper divisors (12618563922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7006708008 is a wasteful number, since it uses less digits than its factorization.
7006708008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10812839 (or 10812826 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The square root of 7006708008 is about 83706.0810694181. The cubic root of 7006708008 is about 1913.5420332943.
The spelling of 7006708008 in words is "seven billion, six million, seven hundred eight thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •