Base | Representation |
---|---|
bin | 11110010001010100011010… |
… | …110101001010111101111001 |
3 | 122110101020210201111010101011 |
4 | 132101110122311022331321 |
5 | 114422211404130422111 |
6 | 1151051442420553521 |
7 | 40020302644452241 |
oct | 3621243265127571 |
9 | 573336721433334 |
10 | 133131551420281 |
11 | 39468857054057 |
12 | 12b219532528a1 |
13 | 593933651387b |
14 | 24c385c60ab21 |
15 | 105d0cce56021 |
hex | 79151ad4af79 |
133131551420281 has 2 divisors, whose sum is σ = 133131551420282. Its totient is φ = 133131551420280.
The previous prime is 133131551420279. The next prime is 133131551420311. The reversal of 133131551420281 is 182024155131331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114225221264400 + 18906330155881 = 10687620^2 + 4348141^2 .
It is a cyclic number.
It is not a de Polignac number, because 133131551420281 - 21 = 133131551420279 is a prime.
It is a super-2 number, since 2×1331315514202812 (a number of 29 digits) contains 22 as substring.
Together with 133131551420279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (133131551423281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66565775710140 + 66565775710141.
It is an arithmetic number, because the mean of its divisors is an integer number (66565775710141).
Almost surely, 2133131551420281 is an apocalyptic number.
It is an amenable number.
133131551420281 is a deficient number, since it is larger than the sum of its proper divisors (1).
133131551420281 is an equidigital number, since it uses as much as digits as its factorization.
133131551420281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 133131551420281 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, five hundred fifty-one million, four hundred twenty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •