Base | Representation |
---|---|
bin | 11000010011010110… |
… | …10111001000001111 |
3 | 1020200021201200011002 |
4 | 30021223113020033 |
5 | 203210044420014 |
6 | 5554400050515 |
7 | 641215624565 |
oct | 141153271017 |
9 | 36607650132 |
10 | 13047263759 |
11 | 5595927412 |
12 | 2641603a3b |
13 | 12cc10c81a |
14 | 8bab4da35 |
15 | 51568adde |
hex | 309ad720f |
13047263759 has 2 divisors, whose sum is σ = 13047263760. Its totient is φ = 13047263758.
The previous prime is 13047263737. The next prime is 13047263771. The reversal of 13047263759 is 95736274031.
13047263759 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13047263759 - 224 = 13030486543 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13047263459) 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, 6523631879 + 6523631880.
It is an arithmetic number, because the mean of its divisors is an integer number (6523631880).
Almost surely, 213047263759 is an apocalyptic number.
13047263759 is a deficient number, since it is larger than the sum of its proper divisors (1).
13047263759 is an equidigital number, since it uses as much as digits as its factorization.
13047263759 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 47.
The spelling of 13047263759 in words is "thirteen billion, forty-seven million, two hundred sixty-three thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •