Base | Representation |
---|---|
bin | 1001111001010001… |
… | …11111000101110011 |
3 | 111201020010001120121 |
4 | 10330220333011303 |
5 | 41334430010220 |
6 | 2235045551111 |
7 | 245434116436 |
oct | 47450770563 |
9 | 14636101517 |
10 | 5312344435 |
11 | 2286753002 |
12 | 1043115497 |
13 | 66878c398 |
14 | 38576981d |
15 | 2115a2eaa |
hex | 13ca3f173 |
5312344435 has 8 divisors (see below), whose sum is σ = 6510447936. Its totient is φ = 4159452480.
The previous prime is 5312344423. The next prime is 5312344447. The reversal of 5312344435 is 5344432135.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5312344423) and next prime (5312344447).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5312344435 - 223 = 5303955827 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5312344435.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 11302626 + ... + 11303095.
It is an arithmetic number, because the mean of its divisors is an integer number (813805992).
Almost surely, 25312344435 is an apocalyptic number.
5312344435 is a deficient number, since it is larger than the sum of its proper divisors (1198103501).
5312344435 is a wasteful number, since it uses less digits than its factorization.
5312344435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22605773.
The product of its digits is 86400, while the sum is 34.
The square root of 5312344435 is about 72885.8315106578. The cubic root of 5312344435 is about 1744.8659798605.
The spelling of 5312344435 in words is "five billion, three hundred twelve million, three hundred forty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •