Base | Representation |
---|---|
bin | 11101101000010000101001… |
… | …110110110101101001010001 |
3 | 122002101111220122112002210210 |
4 | 131220100221312311221101 |
5 | 114034444400030031001 |
6 | 1141051331524114333 |
7 | 36306405345224334 |
oct | 3550205166655121 |
9 | 562344818462723 |
10 | 130310010002001 |
11 | 3858018a520155 |
12 | 12746b528359a9 |
13 | 57932481939ab |
14 | 242707690861b |
15 | 100e9e093ddd6 |
hex | 768429db5a51 |
130310010002001 has 8 divisors (see below), whose sum is σ = 173786411710080. Its totient is φ = 86853474147632.
The previous prime is 130310010001961. The next prime is 130310010002027. The reversal of 130310010002001 is 100200010013031.
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-130310010002001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130310010002041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4966448121 + ... + 4966474358.
It is an arithmetic number, because the mean of its divisors is an integer number (21723301463760).
Almost surely, 2130310010002001 is an apocalyptic number.
It is an amenable number.
130310010002001 is a deficient number, since it is larger than the sum of its proper divisors (43476401708079).
130310010002001 is an equidigital number, since it uses as much as digits as its factorization.
130310010002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9932926855.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 130310010002001 its reverse (100200010013031), we get a palindrome (230510020015032).
The spelling of 130310010002001 in words is "one hundred thirty trillion, three hundred ten billion, ten million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •