Base | Representation |
---|---|
bin | 11101101000011100010010… |
… | …011010001000110111110101 |
3 | 122002102201011012111011211112 |
4 | 131220130102122020313311 |
5 | 114040200440341121001 |
6 | 1141101155232244405 |
7 | 36310330035234065 |
oct | 3550342232106765 |
9 | 562381135434745 |
10 | 130322501504501 |
11 | 3858550a664939 |
12 | 1274945a0a0705 |
13 | 57944890c68a7 |
14 | 24278dd9093a5 |
15 | 100eec23e9cbb |
hex | 768712688df5 |
130322501504501 has 8 divisors (see below), whose sum is σ = 137851556089920. Its totient is φ = 122948685158112.
The previous prime is 130322501504491. The next prime is 130322501504537. The reversal of 130322501504501 is 105405105223031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130322501504501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130322501504561) 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, 38809558031 + ... + 38809561388.
It is an arithmetic number, because the mean of its divisors is an integer number (17231444511240).
Almost surely, 2130322501504501 is an apocalyptic number.
It is an amenable number.
130322501504501 is a deficient number, since it is larger than the sum of its proper divisors (7529054585419).
130322501504501 is an equidigital number, since it uses as much as digits as its factorization.
130322501504501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77619119515.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 130322501504501 its reverse (105405105223031), we get a palindrome (235727606727532).
The spelling of 130322501504501 in words is "one hundred thirty trillion, three hundred twenty-two billion, five hundred one million, five hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •