Base | Representation |
---|---|
bin | 11101100110101010011001… |
… | …111011110011011001100101 |
3 | 122002000000112021112012101200 |
4 | 131212222121323303121211 |
5 | 114031200023111431041 |
6 | 1140525053401113113 |
7 | 36265440566636355 |
oct | 3546523173633145 |
9 | 562000467465350 |
10 | 130200221202021 |
11 | 38538670612813 |
12 | 12729812788799 |
13 | 5785a9c672c19 |
14 | 2421a1d7c0b65 |
15 | 100bc171641b6 |
hex | 766a99ef3665 |
130200221202021 has 12 divisors (see below), whose sum is σ = 197965248611520. Its totient is φ = 82231718653800.
The previous prime is 130200221201933. The next prime is 130200221202137. The reversal of 130200221202021 is 120202122002031.
It is not a de Polignac number, because 130200221202021 - 214 = 130200221185637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130200221201985 and 130200221202003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130200221201021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 380702401005 + ... + 380702401346.
It is an arithmetic number, because the mean of its divisors is an integer number (16497104050960).
Almost surely, 2130200221202021 is an apocalyptic number.
It is an amenable number.
130200221202021 is a deficient number, since it is larger than the sum of its proper divisors (67765027409499).
130200221202021 is a wasteful number, since it uses less digits than its factorization.
130200221202021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 761404802376 (or 761404802373 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 130200221202021 its reverse (120202122002031), we get a palindrome (250402343204052).
The spelling of 130200221202021 in words is "one hundred thirty trillion, two hundred billion, two hundred twenty-one million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •