Base | Representation |
---|---|
bin | 11101100111000110011010… |
… | …111001010101010111011001 |
3 | 122002002220011200001022001101 |
4 | 131213012122321111113121 |
5 | 114032143124314244001 |
6 | 1140550550323151401 |
7 | 36300554201243212 |
oct | 3547063271252731 |
9 | 562086150038041 |
10 | 130230302103001 |
11 | 3854a3a7492961 |
12 | 12733608815561 |
13 | 5788884722509 |
14 | 2423274888409 |
15 | 100c8c7e1da01 |
hex | 76719ae555d9 |
130230302103001 has 32 divisors (see below), whose sum is σ = 133765239421440. Its totient is φ = 126752706662400.
The previous prime is 130230302102963. The next prime is 130230302103023. The reversal of 130230302103001 is 100301203032031.
It is a cyclic number.
It is not a de Polignac number, because 130230302103001 - 227 = 130230167885273 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 130230302103001.
It is not an unprimeable number, because it can be changed into a prime (130230302103301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4686046416 + ... + 4686074206.
It is an arithmetic number, because the mean of its divisors is an integer number (4180163731920).
Almost surely, 2130230302103001 is an apocalyptic number.
It is an amenable number.
130230302103001 is a deficient number, since it is larger than the sum of its proper divisors (3534937318439).
130230302103001 is a wasteful number, since it uses less digits than its factorization.
130230302103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30337.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 130230302103001 its reverse (100301203032031), we get a palindrome (230531505135032).
The spelling of 130230302103001 in words is "one hundred thirty trillion, two hundred thirty billion, three hundred two million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •