Base | Representation |
---|---|
bin | 111110000111101000… |
… | …1111000100010010001 |
3 | 110202022220021000211002 |
4 | 1330033101320202101 |
5 | 4141200441114213 |
6 | 141141104031345 |
7 | 12431533054664 |
oct | 1741721704221 |
9 | 422286230732 |
10 | 133400332433 |
11 | 51636012225 |
12 | 21a2b602555 |
13 | c76c4b5a64 |
14 | 6656d216db |
15 | 370b634658 |
hex | 1f0f478891 |
133400332433 has 2 divisors, whose sum is σ = 133400332434. Its totient is φ = 133400332432.
The previous prime is 133400332421. The next prime is 133400332447. The reversal of 133400332433 is 334233004331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104243745424 + 29156587009 = 322868^2 + 170753^2 .
It is a cyclic number.
It is not a de Polignac number, because 133400332433 - 210 = 133400331409 is a prime.
It is a super-4 number, since 4×1334003324334 (a number of 46 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133400332396 and 133400332405.
It is not a weakly prime, because it can be changed into another prime (133400332463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66700166216 + 66700166217.
It is an arithmetic number, because the mean of its divisors is an integer number (66700166217).
Almost surely, 2133400332433 is an apocalyptic number.
It is an amenable number.
133400332433 is a deficient number, since it is larger than the sum of its proper divisors (1).
133400332433 is an equidigital number, since it uses as much as digits as its factorization.
133400332433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 29.
Adding to 133400332433 its reverse (334233004331), we get a palindrome (467633336764).
The spelling of 133400332433 in words is "one hundred thirty-three billion, four hundred million, three hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •