Base | Representation |
---|---|
bin | 1101111101011000… |
… | …11000010001110001 |
3 | 201100021210110122211 |
4 | 12332230120101301 |
5 | 110322013201423 |
6 | 3235352132121 |
7 | 353500155556 |
oct | 67654302161 |
9 | 21307713584 |
10 | 7494272113 |
11 | 31a6359619 |
12 | 1551997041 |
13 | 925833b53 |
14 | 511460a2d |
15 | 2dce0010d |
hex | 1beb18471 |
7494272113 has 2 divisors, whose sum is σ = 7494272114. Its totient is φ = 7494272112.
The previous prime is 7494272111. The next prime is 7494272117. The reversal of 7494272113 is 3112724947.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4660519824 + 2833752289 = 68268^2 + 53233^2 .
It is a cyclic number.
It is not a de Polignac number, because 7494272113 - 21 = 7494272111 is a prime.
It is a super-2 number, since 2×74942721132 (a number of 21 digits) contains 22 as substring.
Together with 7494272111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (7494272111) by changing a digit.
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 as a sum of consecutive naturals, namely, 3747136056 + 3747136057.
It is an arithmetic number, because the mean of its divisors is an integer number (3747136057).
Almost surely, 27494272113 is an apocalyptic number.
It is an amenable number.
7494272113 is a deficient number, since it is larger than the sum of its proper divisors (1).
7494272113 is an equidigital number, since it uses as much as digits as its factorization.
7494272113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 84672, while the sum is 40.
The square root of 7494272113 is about 86569.4640909830. The cubic root of 7494272113 is about 1956.9353843531.
The spelling of 7494272113 in words is "seven billion, four hundred ninety-four million, two hundred seventy-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •