Base | Representation |
---|---|
bin | 11101101000001000011000… |
… | …000110101001001111100110 |
3 | 122002100122222020121001100210 |
4 | 131220020120012221033212 |
5 | 114034323144242033110 |
6 | 1141043301552120250 |
7 | 36305642164306425 |
oct | 3550103006511746 |
9 | 562318866531323 |
10 | 130301122221030 |
11 | 38577439606822 |
12 | 12745292236086 |
13 | 579245ca44ab7 |
14 | 24268723852bc |
15 | 100e67052c520 |
hex | 7682181a93e6 |
130301122221030 has 64 divisors (see below), whose sum is σ = 323312561768448. Its totient is φ = 33573800263680.
The previous prime is 130301122221013. The next prime is 130301122221043. The reversal of 130301122221030 is 30122221103031.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130301122220988 and 130301122221006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108351259 + ... + 109547238.
It is an arithmetic number, because the mean of its divisors is an integer number (5051758777632).
Almost surely, 2130301122221030 is an apocalyptic number.
130301122221030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130301122221030 is an abundant number, since it is smaller than the sum of its proper divisors (193011439547418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130301122221030 is a wasteful number, since it uses less digits than its factorization.
130301122221030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217899181.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 130301122221030 its reverse (30122221103031), we get a palindrome (160423343324061).
The spelling of 130301122221030 in words is "one hundred thirty trillion, three hundred one billion, one hundred twenty-two million, two hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •