Base | Representation |
---|---|
bin | 1001100111000011… |
… | …01111000000110111 |
3 | 111022120102010222001 |
4 | 10303201233000313 |
5 | 41031304324011 |
6 | 2211544520131 |
7 | 241566406201 |
oct | 46341570067 |
9 | 14276363861 |
10 | 5159448631 |
11 | 2208413137 |
12 | bbba80047 |
13 | 642bb83ac |
14 | 36d329771 |
15 | 202e507c1 |
hex | 13386f037 |
5159448631 has 2 divisors, whose sum is σ = 5159448632. Its totient is φ = 5159448630.
The previous prime is 5159448629. The next prime is 5159448709. The reversal of 5159448631 is 1368449515.
5159448631 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5159448631 - 21 = 5159448629 is a prime.
It is a super-2 number, since 2×51594486312 = 53239820351855548322, which contains 22 as substring.
Together with 5159448629, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5159448601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2579724315 + 2579724316.
It is an arithmetic number, because the mean of its divisors is an integer number (2579724316).
Almost surely, 25159448631 is an apocalyptic number.
5159448631 is a deficient number, since it is larger than the sum of its proper divisors (1).
5159448631 is an equidigital number, since it uses as much as digits as its factorization.
5159448631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 518400, while the sum is 46.
The square root of 5159448631 is about 71829.3020361468. The cubic root of 5159448631 is about 1727.9629683092.
The spelling of 5159448631 in words is "five billion, one hundred fifty-nine million, four hundred forty-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •