Base | Representation |
---|---|
bin | 111101111111010111… |
… | …1111111000111000101 |
3 | 110201121120102122100101 |
4 | 1323332233333013011 |
5 | 4140113442323023 |
6 | 141053400044101 |
7 | 12421624631506 |
oct | 1737657770705 |
9 | 421546378311 |
10 | 133123011013 |
11 | 51503518573 |
12 | 21972763631 |
13 | c726bc8645 |
14 | 662c172bad |
15 | 36e21051ad |
hex | 1efebff1c5 |
133123011013 has 2 divisors, whose sum is σ = 133123011014. Its totient is φ = 133123011012.
The previous prime is 133123010957. The next prime is 133123011061. The reversal of 133123011013 is 310110321331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81365851009 + 51757160004 = 285247^2 + 227502^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133123011013 is a prime.
It is a super-2 number, since 2×1331230110132 (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 (133123011113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66561505506 + 66561505507.
It is an arithmetic number, because the mean of its divisors is an integer number (66561505507).
Almost surely, 2133123011013 is an apocalyptic number.
It is an amenable number.
133123011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
133123011013 is an equidigital number, since it uses as much as digits as its factorization.
133123011013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 133123011013 its reverse (310110321331), we get a palindrome (443233332344).
The spelling of 133123011013 in words is "one hundred thirty-three billion, one hundred twenty-three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •