Base | Representation |
---|---|
bin | 11110010011111101101101… |
… | …010000110000111110111111 |
3 | 122111000121222200210201122002 |
4 | 132103331231100300332333 |
5 | 114433201141142341111 |
6 | 1151311143425012515 |
7 | 40036366264501001 |
oct | 3623755520607677 |
9 | 574017880721562 |
10 | 133313323012031 |
11 | 39528954407348 |
12 | 12b5102218413b |
13 | 59505141ac856 |
14 | 24cc583806371 |
15 | 1062bbae5563b |
hex | 793f6d430fbf |
133313323012031 has 2 divisors, whose sum is σ = 133313323012032. Its totient is φ = 133313323012030.
The previous prime is 133313323012007. The next prime is 133313323012097. The reversal of 133313323012031 is 130210323313331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133313323012031 is a prime.
It is a super-2 number, since 2×1333133230120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133313323011985 and 133313323012003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133313323002031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66656661506015 + 66656661506016.
It is an arithmetic number, because the mean of its divisors is an integer number (66656661506016).
Almost surely, 2133313323012031 is an apocalyptic number.
133313323012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
133313323012031 is an equidigital number, since it uses as much as digits as its factorization.
133313323012031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 133313323012031 its reverse (130210323313331), we get a palindrome (263523646325362).
The spelling of 133313323012031 in words is "one hundred thirty-three trillion, three hundred thirteen billion, three hundred twenty-three million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •