Base | Representation |
---|---|
bin | 11110010111010011000101… |
… | …000110100101000010000011 |
3 | 122111211112100120000202212022 |
4 | 132113103011012211002003 |
5 | 120000424344040101311 |
6 | 1152004313450552055 |
7 | 40062056623003646 |
oct | 3627230506450203 |
9 | 574745316022768 |
10 | 133542430003331 |
11 | 39607032324958 |
12 | 12b8950173862b |
13 | 5968cc68776ab |
14 | 24d96b94b5a5d |
15 | 1068b299085db |
hex | 7974c51a5083 |
133542430003331 has 2 divisors, whose sum is σ = 133542430003332. Its totient is φ = 133542430003330.
The previous prime is 133542430003271. The next prime is 133542430003397. The reversal of 133542430003331 is 133300034245331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133542430003331 - 238 = 133267552096387 is a prime.
It is a super-2 number, since 2×1335424300033312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133542430003291 and 133542430003300.
It is not a weakly prime, because it can be changed into another prime (133542430903331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66771215001665 + 66771215001666.
It is an arithmetic number, because the mean of its divisors is an integer number (66771215001666).
Almost surely, 2133542430003331 is an apocalyptic number.
133542430003331 is a deficient number, since it is larger than the sum of its proper divisors (1).
133542430003331 is an equidigital number, since it uses as much as digits as its factorization.
133542430003331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 35.
Adding to 133542430003331 its reverse (133300034245331), we get a palindrome (266842464248662).
The spelling of 133542430003331 in words is "one hundred thirty-three trillion, five hundred forty-two billion, four hundred thirty million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •