Base | Representation |
---|---|
bin | 11101101001100101100001… |
… | …000110110010001010001001 |
3 | 122002201020010001012201012222 |
4 | 131221211201012302022021 |
5 | 114042443004044221441 |
6 | 1141201241440343425 |
7 | 36316112411046455 |
oct | 3551454106621211 |
9 | 562636101181188 |
10 | 130401131242121 |
11 | 3860589a043573 |
12 | 12760743014b75 |
13 | 579ba0a39265c |
14 | 242b63c6b3665 |
15 | 1012075449d4b |
hex | 7699611b2289 |
130401131242121 has 8 divisors (see below), whose sum is σ = 130557147897120. Its totient is φ = 130245207542208.
The previous prime is 130401131242111. The next prime is 130401131242153. The reversal of 130401131242121 is 121242131104031.
It is a happy number.
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-130401131242121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (130401131242111) 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, 20431211 + ... + 26042976.
It is an arithmetic number, because the mean of its divisors is an integer number (16319643487140).
Almost surely, 2130401131242121 is an apocalyptic number.
It is an amenable number.
130401131242121 is a deficient number, since it is larger than the sum of its proper divisors (156016654999).
130401131242121 is a wasteful number, since it uses less digits than its factorization.
130401131242121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46477543.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 130401131242121 its reverse (121242131104031), we get a palindrome (251643262346152).
The spelling of 130401131242121 in words is "one hundred thirty trillion, four hundred one billion, one hundred thirty-one million, two hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •