Base | Representation |
---|---|
bin | 111100101001011111… |
… | …0110110001001110111 |
3 | 110110011201211202120111 |
4 | 1321102332312021313 |
5 | 4113213223202320 |
6 | 135455413243451 |
7 | 12260333102134 |
oct | 1712276661167 |
9 | 413151752514 |
10 | 130241225335 |
11 | 5026485a311 |
12 | 212a9633587 |
13 | c387b64310 |
14 | 643753d58b |
15 | 35c4112a5a |
hex | 1e52fb6277 |
130241225335 has 8 divisors (see below), whose sum is σ = 168311737440. Its totient is φ = 96178135584.
The previous prime is 130241225243. The next prime is 130241225339. The reversal of 130241225335 is 533522142031.
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 130241225335 - 27 = 130241225207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130241225297 and 130241225306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130241225339) 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, 1001855515 + ... + 1001855644.
It is an arithmetic number, because the mean of its divisors is an integer number (21038967180).
Almost surely, 2130241225335 is an apocalyptic number.
130241225335 is a deficient number, since it is larger than the sum of its proper divisors (38070512105).
130241225335 is a wasteful number, since it uses less digits than its factorization.
130241225335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003711177.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 130241225335 its reverse (533522142031), we get a palindrome (663763367366).
The spelling of 130241225335 in words is "one hundred thirty billion, two hundred forty-one million, two hundred twenty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •