Base | Representation |
---|---|
bin | 101101011110101010011… |
… | …101111111000001101001 |
3 | 102001202221121121022122122 |
4 | 231132222131333001221 |
5 | 402201104102224431 |
6 | 10351424335201025 |
7 | 441536606656616 |
oct | 55365235770151 |
9 | 12052847538578 |
10 | 3125301211241 |
11 | aa548406a310 |
12 | 425855076175 |
13 | 19893a0a9051 |
14 | ab3a030b50d |
15 | 56469ceda7b |
hex | 2d7aa77f069 |
3125301211241 has 8 divisors (see below), whose sum is σ = 3410806039200. Its totient is φ = 2840027472640.
The previous prime is 3125301211213. The next prime is 3125301211267. The reversal of 3125301211241 is 1421121035213.
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 3125301211241 - 226 = 3125234102377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3125301211241.
It is not an unprimeable number, because it can be changed into a prime (3125301201241) 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, 57744056 + ... + 57798153.
It is an arithmetic number, because the mean of its divisors is an integer number (426350754900).
Almost surely, 23125301211241 is an apocalyptic number.
It is an amenable number.
3125301211241 is a deficient number, since it is larger than the sum of its proper divisors (285504827959).
3125301211241 is a wasteful number, since it uses less digits than its factorization.
3125301211241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115544679.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 3125301211241 its reverse (1421121035213), we get a palindrome (4546422246454).
The spelling of 3125301211241 in words is "three trillion, one hundred twenty-five billion, three hundred one million, two hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •