Base | Representation |
---|---|
bin | 11110001111100110010100… |
… | …011001111111001101011111 |
3 | 122102221221122210211212122001 |
4 | 132033212110121333031133 |
5 | 114413242300444432203 |
6 | 1150521251533103131 |
7 | 40005616236305554 |
oct | 3617462431771537 |
9 | 572857583755561 |
10 | 133013332030303 |
11 | 3942270130a66a |
12 | 12b02a5b927aa7 |
13 | 592b1461ba9ca |
14 | 24bbc45970a2b |
15 | 1059eae47891d |
hex | 78f99467f35f |
133013332030303 has 2 divisors, whose sum is σ = 133013332030304. Its totient is φ = 133013332030302.
The previous prime is 133013332030259. The next prime is 133013332030351. The reversal of 133013332030303 is 303030233310331.
It is a weak prime.
It is an emirp because it is prime and its reverse (303030233310331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133013332030303 - 213 = 133013332022111 is a prime.
It is a super-2 number, since 2×1330133320303032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133013332030393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66506666015151 + 66506666015152.
It is an arithmetic number, because the mean of its divisors is an integer number (66506666015152).
Almost surely, 2133013332030303 is an apocalyptic number.
133013332030303 is a deficient number, since it is larger than the sum of its proper divisors (1).
133013332030303 is an equidigital number, since it uses as much as digits as its factorization.
133013332030303 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13122, while the sum is 28.
Adding to 133013332030303 its reverse (303030233310331), we get a palindrome (436043565340634).
The spelling of 133013332030303 in words is "one hundred thirty-three trillion, thirteen billion, three hundred thirty-two million, thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •