Base | Representation |
---|---|
bin | 11110010011110001100101… |
… | …000110111111101100011011 |
3 | 122110222101101012012210200212 |
4 | 132103301211012333230123 |
5 | 114432443004120044402 |
6 | 1151301151341121335 |
7 | 40035425506154012 |
oct | 3623614506775433 |
9 | 573871335183625 |
10 | 133300301331227 |
11 | 39523381a73878 |
12 | 12b4a5a925924b |
13 | 594c21a489694 |
14 | 24cbaaa235a79 |
15 | 10626a7b6e952 |
hex | 793c651bfb1b |
133300301331227 has 2 divisors, whose sum is σ = 133300301331228. Its totient is φ = 133300301331226.
The previous prime is 133300301331137. The next prime is 133300301331251. The reversal of 133300301331227 is 722133103003331.
It is a strong prime.
It is an emirp because it is prime and its reverse (722133103003331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133300301331227 - 218 = 133300301069083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133300301331193 and 133300301331202.
It is not a weakly prime, because it can be changed into another prime (133300301330227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66650150665613 + 66650150665614.
It is an arithmetic number, because the mean of its divisors is an integer number (66650150665614).
Almost surely, 2133300301331227 is an apocalyptic number.
133300301331227 is a deficient number, since it is larger than the sum of its proper divisors (1).
133300301331227 is an equidigital number, since it uses as much as digits as its factorization.
133300301331227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412, while the sum is 32.
Adding to 133300301331227 its reverse (722133103003331), we get a palindrome (855433404334558).
The spelling of 133300301331227 in words is "one hundred thirty-three trillion, three hundred billion, three hundred one million, three hundred thirty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •