Base | Representation |
---|---|
bin | 11110010000111001010011… |
… | …111001111100010001000111 |
3 | 122110021110200012010011221202 |
4 | 132100321103321330101013 |
5 | 114421222301203413111 |
6 | 1151030230240133115 |
7 | 40015222435253564 |
oct | 3620712371742107 |
9 | 573243605104852 |
10 | 133102444201031 |
11 | 3945747a861458 |
12 | 12b1818b30719b |
13 | 59366780b8206 |
14 | 24c229a99d86b |
15 | 105c4778ceb3b |
hex | 790e53e7c447 |
133102444201031 has 2 divisors, whose sum is σ = 133102444201032. Its totient is φ = 133102444201030.
The previous prime is 133102444200941. The next prime is 133102444201039. The reversal of 133102444201031 is 130102444201331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133102444201031 - 230 = 133101370459207 is a prime.
It is a super-2 number, since 2×1331024442010312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133102444200985 and 133102444201003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133102444201039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66551222100515 + 66551222100516.
It is an arithmetic number, because the mean of its divisors is an integer number (66551222100516).
Almost surely, 2133102444201031 is an apocalyptic number.
133102444201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
133102444201031 is an equidigital number, since it uses as much as digits as its factorization.
133102444201031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 133102444201031 its reverse (130102444201331), we get a palindrome (263204888402362).
The spelling of 133102444201031 in words is "one hundred thirty-three trillion, one hundred two billion, four hundred forty-four million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •