Base | Representation |
---|---|
bin | 1101010000000000… |
… | …11111001011001000 |
3 | 200100202121201222020 |
4 | 12220000133023020 |
5 | 104032044323042 |
6 | 3133514324440 |
7 | 341166113505 |
oct | 65000371310 |
9 | 20322551866 |
10 | 7113667272 |
11 | 3020530568 |
12 | 1466429720 |
13 | 894a2359a |
14 | 4b6aa84ac |
15 | 2b97bd3ec |
hex | 1a801f2c8 |
7113667272 has 128 divisors (see below), whose sum is σ = 19152806400. Its totient is φ = 2193850368.
The previous prime is 7113667237. The next prime is 7113667273. The reversal of 7113667272 is 2727663117.
It is not an unprimeable number, because it can be changed into a prime (7113667273) 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 31 ways as a sum of consecutive naturals, for example, 6846129 + ... + 6847167.
It is an arithmetic number, because the mean of its divisors is an integer number (149631300).
Almost surely, 27113667272 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 7113667272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9576403200).
7113667272 is an abundant number, since it is smaller than the sum of its proper divisors (12039139128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7113667272 is a wasteful number, since it uses less digits than its factorization.
7113667272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1335 (or 1331 counting only the distinct ones).
The product of its digits is 148176, while the sum is 42.
The square root of 7113667272 is about 84342.5590790320. The cubic root of 7113667272 is about 1923.2298133453.
The spelling of 7113667272 in words is "seven billion, one hundred thirteen million, six hundred sixty-seven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •