Base | Representation |
---|---|
bin | 111100101000010101… |
… | …0000001111110100111 |
3 | 110110002000102210111202 |
4 | 1321100222001332213 |
5 | 4113123231324221 |
6 | 135451501153115 |
7 | 12256350363311 |
oct | 1712052017647 |
9 | 413060383452 |
10 | 130202214311 |
11 | 502448347a4 |
12 | 2129855b79b |
13 | c37ca55980 |
14 | 64322a67b1 |
15 | 35c09a8d0b |
hex | 1e50a81fa7 |
130202214311 has 8 divisors (see below), whose sum is σ = 148465873584. Its totient is φ = 113116855680.
The previous prime is 130202214287. The next prime is 130202214347. The reversal of 130202214311 is 113412202031.
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 130202214311 - 210 = 130202213287 is a prime.
It is a super-2 number, since 2×1302022143112 (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 (130202214811) 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, 294574925 + ... + 294575366.
It is an arithmetic number, because the mean of its divisors is an integer number (18558234198).
Almost surely, 2130202214311 is an apocalyptic number.
130202214311 is a deficient number, since it is larger than the sum of its proper divisors (18263659273).
130202214311 is a wasteful number, since it uses less digits than its factorization.
130202214311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589150321.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 130202214311 its reverse (113412202031), we get a palindrome (243614416342).
The spelling of 130202214311 in words is "one hundred thirty billion, two hundred two million, two hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.268 sec. • engine limits •