Base | Representation |
---|---|
bin | 11101101000101110101111… |
… | …000110011001000110110010 |
3 | 122002111121021201002012100220 |
4 | 131220232233012121012302 |
5 | 114041012022404021320 |
6 | 1141114233005553510 |
7 | 36311630645443614 |
oct | 3550565706310662 |
9 | 562447251065326 |
10 | 130342310220210 |
11 | 38592955114170 |
12 | 12751267b75896 |
13 | 57962c4c7934a |
14 | 242885c63adb4 |
15 | 101078147de40 |
hex | 768baf1991b2 |
130342310220210 has 32 divisors (see below), whose sum is σ = 341259866759232. Its totient is φ = 31598135810880.
The previous prime is 130342310220197. The next prime is 130342310220257. The reversal of 130342310220210 is 12022013243031.
130342310220210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 197488348489 + ... + 197488349148.
It is an arithmetic number, because the mean of its divisors is an integer number (10664370836226).
Almost surely, 2130342310220210 is an apocalyptic number.
130342310220210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130342310220210 is an abundant number, since it is smaller than the sum of its proper divisors (210917556539022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130342310220210 is a wasteful number, since it uses less digits than its factorization.
130342310220210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394976697658.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 130342310220210 its reverse (12022013243031), we get a palindrome (142364323463241).
The spelling of 130342310220210 in words is "one hundred thirty trillion, three hundred forty-two billion, three hundred ten million, two hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •