Base | Representation |
---|---|
bin | 1001010101010011… |
… | …10000001000001011 |
3 | 110221012020120212001 |
4 | 10222221300020023 |
5 | 40230200233103 |
6 | 2145105331431 |
7 | 235111006150 |
oct | 45251601013 |
9 | 13835216761 |
10 | 5010555403 |
11 | 2141367487 |
12 | b7a036b77 |
13 | 61b0b61a9 |
14 | 35764c227 |
15 | 1e4d3e01d |
hex | 12aa7020b |
5010555403 has 16 divisors (see below), whose sum is σ = 5817057280. Its totient is φ = 4226846976.
The previous prime is 5010555397. The next prime is 5010555409. The reversal of 5010555403 is 3045550105.
5010555403 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 (5010555397) and next prime (5010555409).
It is a cyclic number.
It is not a de Polignac number, because 5010555403 - 229 = 4473684491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5010555409) 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 15 ways as a sum of consecutive naturals, for example, 595675 + ... + 604027.
It is an arithmetic number, because the mean of its divisors is an integer number (363566080).
Almost surely, 25010555403 is an apocalyptic number.
5010555403 is a deficient number, since it is larger than the sum of its proper divisors (806501877).
5010555403 is a wasteful number, since it uses less digits than its factorization.
5010555403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9706.
The product of its (nonzero) digits is 7500, while the sum is 28.
The square root of 5010555403 is about 70785.2767388812. The cubic root of 5010555403 is about 1711.1783999305.
The spelling of 5010555403 in words is "five billion, ten million, five hundred fifty-five thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •