Base | Representation |
---|---|
bin | 11110001111110110111000… |
… | …110110010011101011011011 |
3 | 122110000122120201021011210201 |
4 | 132033312320312103223123 |
5 | 114414040220031200011 |
6 | 1150533353201523031 |
7 | 40010116151524624 |
oct | 3617667066235333 |
9 | 573018521234721 |
10 | 133031123303131 |
11 | 3942a200a99229 |
12 | 12b063a6043477 |
13 | 592ca200c9891 |
14 | 24bca52786a4b |
15 | 105a6a1351cc1 |
hex | 78fdb8d93adb |
133031123303131 has 2 divisors, whose sum is σ = 133031123303132. Its totient is φ = 133031123303130.
The previous prime is 133031123303063. The next prime is 133031123303161. The reversal of 133031123303131 is 131303321130331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133031123303131 - 237 = 132893684349659 is a prime.
It is a super-2 number, since 2×1330311233031312 (a number of 29 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 133031123303131.
It is not a weakly prime, because it can be changed into another prime (133031123303161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515561651565 + 66515561651566.
It is an arithmetic number, because the mean of its divisors is an integer number (66515561651566).
Almost surely, 2133031123303131 is an apocalyptic number.
133031123303131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133031123303131 is an equidigital number, since it uses as much as digits as its factorization.
133031123303131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374, while the sum is 28.
Adding to 133031123303131 its reverse (131303321130331), we get a palindrome (264334444433462).
The spelling of 133031123303131 in words is "one hundred thirty-three trillion, thirty-one billion, one hundred twenty-three million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •