Base | Representation |
---|---|
bin | 1001010000110010… |
… | …11100010100000101 |
3 | 110211120001121222212 |
4 | 10220121130110011 |
5 | 40141004204014 |
6 | 2141234433205 |
7 | 234141320003 |
oct | 45031342405 |
9 | 13746047885 |
10 | 4972725509 |
11 | 2121a79304 |
12 | b69432805 |
13 | 6132cc33b |
14 | 352601a73 |
15 | 1e186a23e |
hex | 12865c505 |
4972725509 has 4 divisors (see below), whose sum is σ = 4979510316. Its totient is φ = 4965940704.
The previous prime is 4972725503. The next prime is 4972725517. The reversal of 4972725509 is 9055272794.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4913589409 + 59136100 = 70097^2 + 7690^2 .
It is a cyclic number.
It is not a de Polignac number, because 4972725509 - 28 = 4972725253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4972725503) 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 3 ways as a sum of consecutive naturals, for example, 3391304 + ... + 3392769.
It is an arithmetic number, because the mean of its divisors is an integer number (1244877579).
Almost surely, 24972725509 is an apocalyptic number.
It is an amenable number.
4972725509 is a deficient number, since it is larger than the sum of its proper divisors (6784807).
4972725509 is an equidigital number, since it uses as much as digits as its factorization.
4972725509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6784806.
The product of its (nonzero) digits is 1587600, while the sum is 50.
The square root of 4972725509 is about 70517.5546158543. The cubic root of 4972725509 is about 1706.8610276990.
The spelling of 4972725509 in words is "four billion, nine hundred seventy-two million, seven hundred twenty-five thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •