Base | Representation |
---|---|
bin | 11110001111100100010001… |
… | …110111101100111000000111 |
3 | 122102221202000011221000122022 |
4 | 132033210101313230320013 |
5 | 114413223304323113411 |
6 | 1150520250341153355 |
7 | 40005511044350111 |
oct | 3617442167547007 |
9 | 572852004830568 |
10 | 133011142004231 |
11 | 39421788082667 |
12 | 12b0254a3bb85b |
13 | 592ab8756c0aa |
14 | 24bbab8b6c3b1 |
15 | 1059dd207bedb |
hex | 78f911dece07 |
133011142004231 has 2 divisors, whose sum is σ = 133011142004232. Its totient is φ = 133011142004230.
The previous prime is 133011142004159. The next prime is 133011142004281. The reversal of 133011142004231 is 132400241110331.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133011142004231 is a prime.
It is a super-2 number, since 2×1330111420042312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133011142004231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133011142004281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66505571002115 + 66505571002116.
It is an arithmetic number, because the mean of its divisors is an integer number (66505571002116).
Almost surely, 2133011142004231 is an apocalyptic number.
133011142004231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133011142004231 is an equidigital number, since it uses as much as digits as its factorization.
133011142004231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 133011142004231 its reverse (132400241110331), we get a palindrome (265411383114562).
The spelling of 133011142004231 in words is "one hundred thirty-three trillion, eleven billion, one hundred forty-two million, four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.273 sec. • engine limits •