Base | Representation |
---|---|
bin | 1001111010000111… |
… | …11100011110110010 |
3 | 111201201102002221201 |
4 | 10331003330132302 |
5 | 41343232133014 |
6 | 2235501241414 |
7 | 245551152505 |
oct | 47503743662 |
9 | 14651362851 |
10 | 5319411634 |
11 | 228a73a769 |
12 | 104556326a |
13 | 66a095064 |
14 | 38668913c |
15 | 211eebe74 |
hex | 13d0fc7b2 |
5319411634 has 8 divisors (see below), whose sum is σ = 8194769388. Its totient is φ = 2587821840.
The previous prime is 5319411631. The next prime is 5319411649. The reversal of 5319411634 is 4361149135.
It can be written as a sum of positive squares in 2 ways, for example, as 5241036025 + 78375609 = 72395^2 + 8853^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×53194116342 = 56592280263869099912, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 5319411593 and 5319411602.
It is not an unprimeable number, because it can be changed into a prime (5319411631) 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 3 ways as a sum of consecutive naturals, for example, 35941897 + ... + 35942044.
Almost surely, 25319411634 is an apocalyptic number.
5319411634 is a deficient number, since it is larger than the sum of its proper divisors (2875357754).
5319411634 is a wasteful number, since it uses less digits than its factorization.
5319411634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71883980.
The product of its digits is 38880, while the sum is 37.
The square root of 5319411634 is about 72934.2966922970. The cubic root of 5319411634 is about 1745.6393892303.
The spelling of 5319411634 in words is "five billion, three hundred nineteen million, four hundred eleven thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •