Base | Representation |
---|---|
bin | 111110000000001100… |
… | …0001111100000001011 |
3 | 110201200110212011012222 |
4 | 1330000120033200023 |
5 | 4140142441404011 |
6 | 141100213524255 |
7 | 12422406140243 |
oct | 1740030174013 |
9 | 421613764188 |
10 | 133150341131 |
11 | 51517995045 |
12 | 2197b94368b |
13 | c72c777302 |
14 | 6631a48b23 |
15 | 36e4702ddb |
hex | 1f0060f80b |
133150341131 has 2 divisors, whose sum is σ = 133150341132. Its totient is φ = 133150341130.
The previous prime is 133150341101. The next prime is 133150341143. The reversal of 133150341131 is 131143051331.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133150341131 - 26 = 133150341067 is a prime.
It is a super-2 number, since 2×1331503411312 (a number of 23 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 133150341131.
It is not a weakly prime, because it can be changed into another prime (133150341101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66575170565 + 66575170566.
It is an arithmetic number, because the mean of its divisors is an integer number (66575170566).
Almost surely, 2133150341131 is an apocalyptic number.
133150341131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133150341131 is an equidigital number, since it uses as much as digits as its factorization.
133150341131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 133150341131 its reverse (131143051331), we get a palindrome (264293392462).
The spelling of 133150341131 in words is "one hundred thirty-three billion, one hundred fifty million, three hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •