Base | Representation |
---|---|
bin | 11110001111111001111000… |
… | …000010110000010100001011 |
3 | 122110000221212021010210110012 |
4 | 132033321320002300110023 |
5 | 114414113302214430121 |
6 | 1150535043350142135 |
7 | 40010261511602561 |
oct | 3617717002602413 |
9 | 573027767123405 |
10 | 133034331014411 |
11 | 394305a7729192 |
12 | 12b06b4035194b |
13 | 59301118382a8 |
14 | 24bcc787bba31 |
15 | 105a7dcc74c5b |
hex | 78fe780b050b |
133034331014411 has 2 divisors, whose sum is σ = 133034331014412. Its totient is φ = 133034331014410.
The previous prime is 133034331014401. The next prime is 133034331014437. The reversal of 133034331014411 is 114410133430331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133034331014411 is a prime.
It is not a weakly prime, because it can be changed into another prime (133034331014401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66517165507205 + 66517165507206.
It is an arithmetic number, because the mean of its divisors is an integer number (66517165507206).
Almost surely, 2133034331014411 is an apocalyptic number.
133034331014411 is a deficient number, since it is larger than the sum of its proper divisors (1).
133034331014411 is an equidigital number, since it uses as much as digits as its factorization.
133034331014411 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.
Adding to 133034331014411 its reverse (114410133430331), we get a palindrome (247444464444742).
The spelling of 133034331014411 in words is "one hundred thirty-three trillion, thirty-four billion, three hundred thirty-one million, fourteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •