Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0010010011011110101 |
3 | 110110001221120221121010 |
4 | 1321100212102123311 |
5 | 4113123003430031 |
6 | 135451424142433 |
7 | 12256336135620 |
oct | 1712046223365 |
9 | 413057527533 |
10 | 130201233141 |
11 | 50244224611 |
12 | 21298167a19 |
13 | c37c7a11b5 |
14 | 64320ccdb7 |
15 | 35c0863246 |
hex | 1e509926f5 |
130201233141 has 32 divisors (see below), whose sum is σ = 204081131520. Its totient is φ = 72293766336.
The previous prime is 130201233137. The next prime is 130201233161. The reversal of 130201233141 is 141332102031.
It is not a de Polignac number, because 130201233141 - 22 = 130201233137 is a prime.
It is a super-2 number, since 2×1302012331412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201233161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 337326 + ... + 611711.
It is an arithmetic number, because the mean of its divisors is an integer number (6377535360).
Almost surely, 2130201233141 is an apocalyptic number.
It is an amenable number.
130201233141 is a deficient number, since it is larger than the sum of its proper divisors (73879898379).
130201233141 is a wasteful number, since it uses less digits than its factorization.
130201233141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949233.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 130201233141 its reverse (141332102031), we get a palindrome (271533335172).
The spelling of 130201233141 in words is "one hundred thirty billion, two hundred one million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •