Base | Representation |
---|---|
bin | 11110001111011101000101… |
… | …001111111010000010100111 |
3 | 122102221000001121102102112111 |
4 | 132033131011033322002213 |
5 | 114413111442444144111 |
6 | 1150512531440301451 |
7 | 40005115406013124 |
oct | 3617350517720247 |
9 | 572830047372474 |
10 | 133003414053031 |
11 | 39419481928535 |
12 | 12b00b52311887 |
13 | 592a2254bb4c2 |
14 | 24bb58467d74b |
15 | 1059acd8bda21 |
hex | 78f7453fa0a7 |
133003414053031 has 2 divisors, whose sum is σ = 133003414053032. Its totient is φ = 133003414053030.
The previous prime is 133003414053017. The next prime is 133003414053053. The reversal of 133003414053031 is 130350414300331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133003414053031 - 221 = 133003411955879 is a prime.
It is a super-2 number, since 2×1330034140530312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133003414052984 and 133003414053002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133003414083031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66501707026515 + 66501707026516.
It is an arithmetic number, because the mean of its divisors is an integer number (66501707026516).
Almost surely, 2133003414053031 is an apocalyptic number.
133003414053031 is a deficient number, since it is larger than the sum of its proper divisors (1).
133003414053031 is an equidigital number, since it uses as much as digits as its factorization.
133003414053031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 133003414053031 its reverse (130350414300331), we get a palindrome (263353828353362).
The spelling of 133003414053031 in words is "one hundred thirty-three trillion, three billion, four hundred fourteen million, fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •