Base | Representation |
---|---|
bin | 11101100110101010010100… |
… | …100001000010100100110011 |
3 | 122002000000021221110220112222 |
4 | 131212222110201002210303 |
5 | 114031144331324101321 |
6 | 1140525040352511255 |
7 | 36265435414166456 |
oct | 3546522441024463 |
9 | 562000257426488 |
10 | 130200130300211 |
11 | 38538624275954 |
12 | 127297a824b52b |
13 | 5785a8689667a |
14 | 2421a116bb49d |
15 | 100bc0e1aa3ab |
hex | 766a94842933 |
130200130300211 has 4 divisors (see below), whose sum is σ = 130204261439712. Its totient is φ = 130195999160712.
The previous prime is 130200130300067. The next prime is 130200130300217. The reversal of 130200130300211 is 112003031002031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130200130300211 - 230 = 130199056558387 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130200130300211.
It is not an unprimeable number, because it can be changed into a prime (130200130300217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2065522475 + ... + 2065585508.
It is an arithmetic number, because the mean of its divisors is an integer number (32551065359928).
Almost surely, 2130200130300211 is an apocalyptic number.
130200130300211 is a deficient number, since it is larger than the sum of its proper divisors (4131139501).
130200130300211 is an equidigital number, since it uses as much as digits as its factorization.
130200130300211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4131139500.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130200130300211 its reverse (112003031002031), we get a palindrome (242203161302242).
The spelling of 130200130300211 in words is "one hundred thirty trillion, two hundred billion, one hundred thirty million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •