Base | Representation |
---|---|
bin | 1001010111010001… |
… | …01001110011111011 |
3 | 110222100021022210011 |
4 | 10223220221303323 |
5 | 40243410411403 |
6 | 2150455002351 |
7 | 235401113500 |
oct | 45350516373 |
9 | 13870238704 |
10 | 5027044603 |
11 | 214a6aa019 |
12 | b836693b7 |
13 | 62163a609 |
14 | 3599014a7 |
15 | 1e64e9a6d |
hex | 12ba29cfb |
5027044603 has 12 divisors (see below), whose sum is σ = 5856387480. Its totient is φ = 4302557952.
The previous prime is 5027044597. The next prime is 5027044609. The reversal of 5027044603 is 3064407205.
5027044603 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (5027044597) and next prime (5027044609).
It is not a de Polignac number, because 5027044603 - 25 = 5027044571 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5027044609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41638 + ... + 108571.
It is an arithmetic number, because the mean of its divisors is an integer number (488032290).
Almost surely, 25027044603 is an apocalyptic number.
5027044603 is a deficient number, since it is larger than the sum of its proper divisors (829342877).
5027044603 is a wasteful number, since it uses less digits than its factorization.
5027044603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150906 (or 150899 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 31.
The square root of 5027044603 is about 70901.6544447307. The cubic root of 5027044603 is about 1713.0534460527.
The spelling of 5027044603 in words is "five billion, twenty-seven million, forty-four thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •