Base | Representation |
---|---|
bin | 11101100110111100110100… |
… | …111010101000010101001001 |
3 | 122002001220120210010211210001 |
4 | 131212330310322220111021 |
5 | 114032011030303412301 |
6 | 1140542124231523001 |
7 | 36300041011264006 |
oct | 3546746472502511 |
9 | 562056523124701 |
10 | 130220001232201 |
11 | 38545aa095a1a1 |
12 | 12731612b29461 |
13 | 57879025c0aaa |
14 | 24229787a68ad |
15 | 100c4c392dc01 |
hex | 766f34ea8549 |
130220001232201 has 8 divisors (see below), whose sum is σ = 137073793392800. Its totient is φ = 123366219860160.
The previous prime is 130220001232159. The next prime is 130220001232219. The reversal of 130220001232201 is 102232100022031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130220001232201 - 27 = 130220001232073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130220001232241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37247041 + ... + 40592881.
It is an arithmetic number, because the mean of its divisors is an integer number (17134224174100).
Almost surely, 2130220001232201 is an apocalyptic number.
It is an amenable number.
130220001232201 is a deficient number, since it is larger than the sum of its proper divisors (6853792160599).
130220001232201 is a wasteful number, since it uses less digits than its factorization.
130220001232201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5394279.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 130220001232201 its reverse (102232100022031), we get a palindrome (232452101254232).
The spelling of 130220001232201 in words is "one hundred thirty trillion, two hundred twenty billion, one million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.047 sec. • engine limits •