Base | Representation |
---|---|
bin | 111101001101010001… |
… | …1111110011101101001 |
3 | 110120021102120121012200 |
4 | 1322122203332131221 |
5 | 4123143142003113 |
6 | 140214513130413 |
7 | 12332154523110 |
oct | 1723243763551 |
9 | 416242517180 |
10 | 131442141033 |
11 | 50820731025 |
12 | 21583859a09 |
13 | c5198b9518 |
14 | 650cc2ac77 |
15 | 364477e873 |
hex | 1e9a8fe769 |
131442141033 has 72 divisors (see below), whose sum is σ = 230751318720. Its totient is φ = 70614028800.
The previous prime is 131442141029. The next prime is 131442141071. The reversal of 131442141033 is 330141244131.
131442141033 is a `hidden beast` number, since 131 + 4 + 421 + 4 + 103 + 3 = 666.
It is not a de Polignac number, because 131442141033 - 22 = 131442141029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131442140988 and 131442141006.
It is not an unprimeable number, because it can be changed into a prime (131442141533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 19132123 + ... + 19138991.
Almost surely, 2131442141033 is an apocalyptic number.
It is an amenable number.
131442141033 is a deficient number, since it is larger than the sum of its proper divisors (99309177687).
131442141033 is a wasteful number, since it uses less digits than its factorization.
131442141033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7967 (or 7947 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 131442141033 its reverse (330141244131), we get a palindrome (461583385164).
The spelling of 131442141033 in words is "one hundred thirty-one billion, four hundred forty-two million, one hundred forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •