Base | Representation |
---|---|
bin | 1001101101100000… |
… | …00010100101000011 |
3 | 111110100011210020211 |
4 | 10312300002211003 |
5 | 41134130433220 |
6 | 2221200014551 |
7 | 243124164121 |
oct | 46660024503 |
9 | 14410153224 |
10 | 5213530435 |
11 | 22359a1643 |
12 | 1016001457 |
13 | 651172669 |
14 | 3765a6911 |
15 | 207a84b5a |
hex | 136c02943 |
5213530435 has 8 divisors (see below), whose sum is σ = 6273285696. Its totient is φ = 4159458240.
The previous prime is 5213530417. The next prime is 5213530453. The reversal of 5213530435 is 5340353125.
It is an interprime number because it is at equal distance from previous prime (5213530417) and next prime (5213530453).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5213530435 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5213530397 and 5213530406.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1418746 + ... + 1422415.
It is an arithmetic number, because the mean of its divisors is an integer number (784160712).
Almost surely, 25213530435 is an apocalyptic number.
5213530435 is a deficient number, since it is larger than the sum of its proper divisors (1059755261).
5213530435 is a wasteful number, since it uses less digits than its factorization.
5213530435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2841533.
The product of its (nonzero) digits is 27000, while the sum is 31.
The square root of 5213530435 is about 72204.7812475047. The cubic root of 5213530435 is about 1733.9795492578.
The spelling of 5213530435 in words is "five billion, two hundred thirteen million, five hundred thirty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •