Base | Representation |
---|---|
bin | 11000111001011011… |
… | …00010011001001101 |
3 | 1021111112121200220011 |
4 | 30130231202121031 |
5 | 204333322220133 |
6 | 10050204353221 |
7 | 652144144033 |
oct | 143455423115 |
9 | 37445550804 |
10 | 13366601293 |
11 | 573a109431 |
12 | 2710545811 |
13 | 135031b346 |
14 | 90b318553 |
15 | 5337196cd |
hex | 31cb6264d |
13366601293 has 2 divisors, whose sum is σ = 13366601294. Its totient is φ = 13366601292.
The previous prime is 13366601273. The next prime is 13366601329. The reversal of 13366601293 is 39210666331.
13366601293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (13366601329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13363822404 + 2778889 = 115602^2 + 1667^2 .
It is a cyclic number.
It is not a de Polignac number, because 13366601293 - 29 = 13366600781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13366601273) 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, 6683300646 + 6683300647.
It is an arithmetic number, because the mean of its divisors is an integer number (6683300647).
Almost surely, 213366601293 is an apocalyptic number.
It is an amenable number.
13366601293 is a deficient number, since it is larger than the sum of its proper divisors (1).
13366601293 is an equidigital number, since it uses as much as digits as its factorization.
13366601293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 40.
The spelling of 13366601293 in words is "thirteen billion, three hundred sixty-six million, six hundred one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •