Base | Representation |
---|---|
bin | 1000011010110110… |
… | …11100000110110101 |
3 | 102200000200012122112 |
4 | 10031123130012311 |
5 | 33224141422432 |
6 | 2024312540405 |
7 | 220005416405 |
oct | 41533340665 |
9 | 12600605575 |
10 | 4520264117 |
11 | 1a0a631376 |
12 | a619b1705 |
13 | 5706501c5 |
14 | 30c4a2805 |
15 | 1b6c927b2 |
hex | 10d6dc1b5 |
4520264117 has 8 divisors (see below), whose sum is σ = 4608773400. Its totient is φ = 4432610304.
The previous prime is 4520264093. The next prime is 4520264131. The reversal of 4520264117 is 7114620254.
It can be written as a sum of positive squares in 4 ways, for example, as 934769476 + 3585494641 = 30574^2 + 59879^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4520264117 - 212 = 4520260021 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 (4520264167) 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 in 7 ways as a sum of consecutive naturals, for example, 203192 + ... + 224337.
It is an arithmetic number, because the mean of its divisors is an integer number (576096675).
Almost surely, 24520264117 is an apocalyptic number.
It is an amenable number.
4520264117 is a deficient number, since it is larger than the sum of its proper divisors (88509283).
4520264117 is a wasteful number, since it uses less digits than its factorization.
4520264117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427735.
The product of its (nonzero) digits is 13440, while the sum is 32.
The square root of 4520264117 is about 67232.9094789152. The cubic root of 4520264117 is about 1653.4380857318.
The spelling of 4520264117 in words is "four billion, five hundred twenty million, two hundred sixty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •