Base | Representation |
---|---|
bin | 1101001001101000… |
… | …10000110100000000 |
3 | 200020000212211010000 |
4 | 12210310100310000 |
5 | 103424343143242 |
6 | 3124323040000 |
7 | 336646060341 |
oct | 64464206400 |
9 | 20200784100 |
10 | 7060131072 |
11 | 2aa3294a75 |
12 | 1450510000 |
13 | 8868ca767 |
14 | 4ad9300c8 |
15 | 2b4c45a4c |
hex | 1a4d10d00 |
7060131072 has 90 divisors (see below), whose sum is σ = 21052095218. Its totient is φ = 2353370112.
The previous prime is 7060131049. The next prime is 7060131103. The reversal of 7060131072 is 2701310607.
It can be written as a sum of positive squares in only one way, i.e., 6999664896 + 60466176 = 83664^2 + 7776^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 149503 + ... + 190974.
Almost surely, 27060131072 is an apocalyptic number.
7060131072 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
7060131072 is an abundant number, since it is smaller than the sum of its proper divisors (13991964146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7060131072 is an equidigital number, since it uses as much as digits as its factorization.
7060131072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340505 (or 340482 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
The square root of 7060131072 is about 84024.5861162077. The cubic root of 7060131072 is about 1918.3930304006.
Adding to 7060131072 its reverse (2701310607), we get a palindrome (9761441679).
The spelling of 7060131072 in words is "seven billion, sixty million, one hundred thirty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •