Base | Representation |
---|---|
bin | 1001010111010010… |
… | …00010011011011011 |
3 | 110222100110110002200 |
4 | 10223221002123123 |
5 | 40243422123220 |
6 | 2150501101243 |
7 | 235402013454 |
oct | 45351023333 |
9 | 13870413080 |
10 | 5027145435 |
11 | 214a768854 |
12 | b836b7823 |
13 | 621674490 |
14 | 35992a12b |
15 | 1e6519890 |
hex | 12ba426db |
5027145435 has 48 divisors (see below), whose sum is σ = 9405396000. Its totient is φ = 2469261312.
The previous prime is 5027145433. The next prime is 5027145467. The reversal of 5027145435 is 5345417205.
5027145435 is a `hidden beast` number, since 502 + 7 + 145 + 4 + 3 + 5 = 666.
It is not a de Polignac number, because 5027145435 - 21 = 5027145433 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5027145435.
It is not an unprimeable number, because it can be changed into a prime (5027145433) 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 47 ways as a sum of consecutive naturals, for example, 253096 + ... + 272234.
It is an arithmetic number, because the mean of its divisors is an integer number (195945750).
Almost surely, 25027145435 is an apocalyptic number.
5027145435 is a deficient number, since it is larger than the sum of its proper divisors (4378250565).
5027145435 is a wasteful number, since it uses less digits than its factorization.
5027145435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19612 (or 19609 counting only the distinct ones).
The product of its (nonzero) digits is 84000, while the sum is 36.
The square root of 5027145435 is about 70902.3655106090. The cubic root of 5027145435 is about 1713.0648993991.
The spelling of 5027145435 in words is "five billion, twenty-seven million, one hundred forty-five thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •