Base | Representation |
---|---|
bin | 111101111100101001… |
… | …0111101000110100001 |
3 | 110201101012021010202201 |
4 | 1323321102331012201 |
5 | 4134422031431104 |
6 | 141040331013201 |
7 | 12416434134064 |
oct | 1737122750641 |
9 | 421335233681 |
10 | 133031514529 |
11 | 51466904941 |
12 | 21947b9a201 |
13 | c710c71504 |
14 | 661dd568db |
15 | 36d90800a4 |
hex | 1ef94bd1a1 |
133031514529 has 2 divisors, whose sum is σ = 133031514530. Its totient is φ = 133031514528.
The previous prime is 133031514479. The next prime is 133031514533. The reversal of 133031514529 is 925415130331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68291800929 + 64739713600 = 261327^2 + 254440^2 .
It is a cyclic number.
It is not a de Polignac number, because 133031514529 - 219 = 133030990241 is a prime.
It is a super-3 number, since 3×1330315145293 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (133031514829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515757264 + 66515757265.
It is an arithmetic number, because the mean of its divisors is an integer number (66515757265).
Almost surely, 2133031514529 is an apocalyptic number.
It is an amenable number.
133031514529 is a deficient number, since it is larger than the sum of its proper divisors (1).
133031514529 is an equidigital number, since it uses as much as digits as its factorization.
133031514529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 133031514529 in words is "one hundred thirty-three billion, thirty-one million, five hundred fourteen thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •