Base | Representation |
---|---|
bin | 1000011000011101… |
… | …01010011001101101 |
3 | 102121121210200020021 |
4 | 10030032222121231 |
5 | 33204013400311 |
6 | 2022313322141 |
7 | 216342352432 |
oct | 41416523155 |
9 | 12547720207 |
10 | 4500137581 |
11 | 19aa234a75 |
12 | a57106351 |
13 | 569424304 |
14 | 309943b89 |
15 | 1b5119171 |
hex | 10c3aa66d |
4500137581 has 2 divisors, whose sum is σ = 4500137582. Its totient is φ = 4500137580.
The previous prime is 4500137569. The next prime is 4500137639. The reversal of 4500137581 is 1857310054.
It is a happy number.
4500137581 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3379561956 + 1120575625 = 58134^2 + 33475^2 .
It is a cyclic number.
It is not a de Polignac number, because 4500137581 - 211 = 4500135533 is a prime.
It is a super-2 number, since 2×45001375812 = 40502476495857063122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4500137501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2250068790 + 2250068791.
It is an arithmetic number, because the mean of its divisors is an integer number (2250068791).
Almost surely, 24500137581 is an apocalyptic number.
It is an amenable number.
4500137581 is a deficient number, since it is larger than the sum of its proper divisors (1).
4500137581 is an equidigital number, since it uses as much as digits as its factorization.
4500137581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16800, while the sum is 34.
The square root of 4500137581 is about 67083.0647853838. The cubic root of 4500137581 is about 1650.9804495519.
The spelling of 4500137581 in words is "four billion, five hundred million, one hundred thirty-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.292 sec. • engine limits •