Base | Representation |
---|---|
bin | 11000011101011111… |
… | …10000101100011101 |
3 | 1020220012202010020112 |
4 | 30032233300230131 |
5 | 203343332200013 |
6 | 10011034455405 |
7 | 643300510025 |
oct | 141657605435 |
9 | 36805663215 |
10 | 13132303133 |
11 | 562992a794 |
12 | 2665b94565 |
13 | 1313915891 |
14 | 8c8168a85 |
15 | 51cd87ba8 |
hex | 30ebf0b1d |
13132303133 has 2 divisors, whose sum is σ = 13132303134. Its totient is φ = 13132303132.
The previous prime is 13132303109. The next prime is 13132303201. The reversal of 13132303133 is 33130323131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7461158884 + 5671144249 = 86378^2 + 75307^2 .
It is a cyclic number.
It is not a de Polignac number, because 13132303133 - 28 = 13132302877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13132303099 and 13132303108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13132303333) 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 as a sum of consecutive naturals, namely, 6566151566 + 6566151567.
It is an arithmetic number, because the mean of its divisors is an integer number (6566151567).
Almost surely, 213132303133 is an apocalyptic number.
It is an amenable number.
13132303133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13132303133 is an equidigital number, since it uses as much as digits as its factorization.
13132303133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 13132303133 its reverse (33130323131), we get a palindrome (46262626264).
The spelling of 13132303133 in words is "thirteen billion, one hundred thirty-two million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •