Base | Representation |
---|---|
bin | 111100101000100110… |
… | …0011001011001100111 |
3 | 110110002122101111022012 |
4 | 1321101030121121213 |
5 | 4113133033120033 |
6 | 135452422224435 |
7 | 12256520064161 |
oct | 1712114313147 |
9 | 413078344265 |
10 | 130211223143 |
11 | 50249928211 |
12 | 2129b58511b |
13 | c38188b341 |
14 | 643356d931 |
15 | 35c1688248 |
hex | 1e51319667 |
130211223143 has 8 divisors (see below), whose sum is σ = 132762272400. Its totient is φ = 127663664128.
The previous prime is 130211223137. The next prime is 130211223161. The reversal of 130211223143 is 341322112031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130211223143 - 24 = 130211223127 is a prime.
It is a super-2 number, since 2×1302112231432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130211223113) 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 7 ways as a sum of consecutive naturals, for example, 797153 + ... + 946506.
It is an arithmetic number, because the mean of its divisors is an integer number (16595284050).
Almost surely, 2130211223143 is an apocalyptic number.
130211223143 is a deficient number, since it is larger than the sum of its proper divisors (2551049257).
130211223143 is a wasteful number, since it uses less digits than its factorization.
130211223143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1745121.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 130211223143 its reverse (341322112031), we get a palindrome (471533335174).
The spelling of 130211223143 in words is "one hundred thirty billion, two hundred eleven million, two hundred twenty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •