Base | Representation |
---|---|
bin | 11110001111111001110010… |
… | …111010110010100010101111 |
3 | 122110000221122021100212010222 |
4 | 132033321302322302202233 |
5 | 114414113113212242203 |
6 | 1150535031035321555 |
7 | 40010256416045315 |
oct | 3617716272624257 |
9 | 573027567325128 |
10 | 133034245040303 |
11 | 39430563147602 |
12 | 12b06b175b02bb |
13 | 59300c9a95939 |
14 | 24bcc6b1dc0b5 |
15 | 105a7d5441038 |
hex | 78fe72eb28af |
133034245040303 has 2 divisors, whose sum is σ = 133034245040304. Its totient is φ = 133034245040302.
The previous prime is 133034245040299. The next prime is 133034245040339. The reversal of 133034245040303 is 303040542430331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133034245040303 - 22 = 133034245040299 is a prime.
It is a super-2 number, since 2×1330342450403032 (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 (133034245040803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66517122520151 + 66517122520152.
It is an arithmetic number, because the mean of its divisors is an integer number (66517122520152).
Almost surely, 2133034245040303 is an apocalyptic number.
133034245040303 is a deficient number, since it is larger than the sum of its proper divisors (1).
133034245040303 is an equidigital number, since it uses as much as digits as its factorization.
133034245040303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 35.
Adding to 133034245040303 its reverse (303040542430331), we get a palindrome (436074787470634).
The spelling of 133034245040303 in words is "one hundred thirty-three trillion, thirty-four billion, two hundred forty-five million, forty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •