Base | Representation |
---|---|
bin | 111110000100111110… |
… | …1001110110010100011 |
3 | 110202002200020010022112 |
4 | 1330021331032302203 |
5 | 4141010111014413 |
6 | 141124154025535 |
7 | 12426400036166 |
oct | 1741175166243 |
9 | 422080203275 |
10 | 133311032483 |
11 | 5159a669912 |
12 | 21a057182ab |
13 | c756b4a655 |
14 | 6649117add |
15 | 37038952a8 |
hex | 1f09f4eca3 |
133311032483 has 2 divisors, whose sum is σ = 133311032484. Its totient is φ = 133311032482.
The previous prime is 133311032479. The next prime is 133311032521. The reversal of 133311032483 is 384230113331.
It is a weak prime.
It is an emirp because it is prime and its reverse (384230113331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133311032483 - 22 = 133311032479 is a prime.
It is a super-2 number, since 2×1333110324832 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133311032423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66655516241 + 66655516242.
It is an arithmetic number, because the mean of its divisors is an integer number (66655516242).
Almost surely, 2133311032483 is an apocalyptic number.
133311032483 is a deficient number, since it is larger than the sum of its proper divisors (1).
133311032483 is an equidigital number, since it uses as much as digits as its factorization.
133311032483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 133311032483 in words is "one hundred thirty-three billion, three hundred eleven million, thirty-two thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •