Base | Representation |
---|---|
bin | 11110001111101111010110… |
… | …000011000000010011101011 |
3 | 122102222212200012120011001122 |
4 | 132033233112003000103223 |
5 | 114413422122422030311 |
6 | 1150525533325205455 |
7 | 40006411344223544 |
oct | 3617572603002353 |
9 | 572885605504048 |
10 | 133023023236331 |
11 | 39426824794148 |
12 | 12b0490540088b |
13 | 592c02bc1b747 |
14 | 24bc4c4ab14cb |
15 | 105a37a18c0db |
hex | 78fbd60c04eb |
133023023236331 has 2 divisors, whose sum is σ = 133023023236332. Its totient is φ = 133023023236330.
The previous prime is 133023023236291. The next prime is 133023023236357. The reversal of 133023023236331 is 133632320320331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133023023236331 - 26 = 133023023236267 is a prime.
It is a super-2 number, since 2×1330230232363312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133023023236291 and 133023023236300.
It is not a weakly prime, because it can be changed into another prime (133023023238331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511511618165 + 66511511618166.
It is an arithmetic number, because the mean of its divisors is an integer number (66511511618166).
Almost surely, 2133023023236331 is an apocalyptic number.
133023023236331 is a deficient number, since it is larger than the sum of its proper divisors (1).
133023023236331 is an equidigital number, since it uses as much as digits as its factorization.
133023023236331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 35.
Adding to 133023023236331 its reverse (133632320320331), we get a palindrome (266655343556662).
The spelling of 133023023236331 in words is "one hundred thirty-three trillion, twenty-three billion, twenty-three million, two hundred thirty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •