Base | Representation |
---|---|
bin | 1101010101000100… |
… | …11001111101111000 |
3 | 200110201111012221022 |
4 | 12222202121331320 |
5 | 104123431111042 |
6 | 3142032202012 |
7 | 342222650000 |
oct | 65242317570 |
9 | 20421435838 |
10 | 7156113272 |
11 | 3042491900 |
12 | 1478699308 |
13 | 8a0765569 |
14 | 4bc597000 |
15 | 2bd3a4cd2 |
hex | 1aa899f78 |
7156113272 has 120 divisors (see below), whose sum is σ = 17211024600. Its totient is φ = 2787190560.
The previous prime is 7156113271. The next prime is 7156113337. The reversal of 7156113272 is 2723116517.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7156113271) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 2322629 + ... + 2325707.
It is an arithmetic number, because the mean of its divisors is an integer number (143425205).
Almost surely, 27156113272 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 7156113272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8605512300).
7156113272 is an abundant number, since it is smaller than the sum of its proper divisors (10054911328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7156113272 is a wasteful number, since it uses less digits than its factorization.
7156113272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3135 (or 3099 counting only the distinct ones).
The product of its digits is 17640, while the sum is 35.
The square root of 7156113272 is about 84593.8134380996. The cubic root of 7156113272 is about 1927.0474215993.
Adding to 7156113272 its reverse (2723116517), we get a palindrome (9879229789).
The spelling of 7156113272 in words is "seven billion, one hundred fifty-six million, one hundred thirteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •