Base | Representation |
---|---|
bin | 111110001111000101… |
… | …1111110000010111101 |
3 | 110202222022212211102102 |
4 | 1330132023332002331 |
5 | 4142204003043011 |
6 | 141222000434445 |
7 | 12440660666453 |
oct | 1743613760275 |
9 | 422868784372 |
10 | 133650440381 |
11 | 5175420a007 |
12 | 21a9b318a25 |
13 | c7ac265623 |
14 | 667c2289d3 |
15 | 372358a73b |
hex | 1f1e2fe0bd |
133650440381 has 2 divisors, whose sum is σ = 133650440382. Its totient is φ = 133650440380.
The previous prime is 133650440311. The next prime is 133650440389. The reversal of 133650440381 is 183044056331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84381535225 + 49268905156 = 290485^2 + 221966^2 .
It is an emirp because it is prime and its reverse (183044056331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133650440381 - 214 = 133650423997 is a prime.
It is a super-2 number, since 2×1336504403812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133650440389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66825220190 + 66825220191.
It is an arithmetic number, because the mean of its divisors is an integer number (66825220191).
Almost surely, 2133650440381 is an apocalyptic number.
It is an amenable number.
133650440381 is a deficient number, since it is larger than the sum of its proper divisors (1).
133650440381 is an equidigital number, since it uses as much as digits as its factorization.
133650440381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 133650440381 in words is "one hundred thirty-three billion, six hundred fifty million, four hundred forty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •