Base | Representation |
---|---|
bin | 11000101111101011… |
… | …10001000110010001 |
3 | 1021021211211110012021 |
4 | 30113311301012101 |
5 | 204201411410333 |
6 | 10034124531441 |
7 | 650132360656 |
oct | 142765610621 |
9 | 37254743167 |
10 | 13284872593 |
11 | 56a7a67453 |
12 | 26a90b0b81 |
13 | 1339404175 |
14 | 900521c2d |
15 | 52b47382d |
hex | 317d71191 |
13284872593 has 2 divisors, whose sum is σ = 13284872594. Its totient is φ = 13284872592.
The previous prime is 13284872543. The next prime is 13284872609. The reversal of 13284872593 is 39527848231.
It is a happy number.
13284872593 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 can be written as a sum of positive squares in only one way, i.e., 11179255824 + 2105616769 = 105732^2 + 45887^2 .
It is a cyclic number.
It is not a de Polignac number, because 13284872593 - 213 = 13284864401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13284872593.
It is not a weakly prime, because it can be changed into another prime (13284872543) 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, 6642436296 + 6642436297.
It is an arithmetic number, because the mean of its divisors is an integer number (6642436297).
Almost surely, 213284872593 is an apocalyptic number.
It is an amenable number.
13284872593 is a deficient number, since it is larger than the sum of its proper divisors (1).
13284872593 is an equidigital number, since it uses as much as digits as its factorization.
13284872593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2903040, while the sum is 52.
The spelling of 13284872593 in words is "thirteen billion, two hundred eighty-four million, eight hundred seventy-two thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •