Base | Representation |
---|---|
bin | 101111001001110111101… |
… | …110110111000101001001 |
3 | 102110210002000211200020001 |
4 | 233021313232313011021 |
5 | 411042332003122441 |
6 | 10520343052203001 |
7 | 453053324336512 |
oct | 57116756670511 |
9 | 12423060750201 |
10 | 3240414114121 |
11 | 103a285320a98 |
12 | 444020169461 |
13 | 1a6753945272 |
14 | b2ba0581a09 |
15 | 59455c00731 |
hex | 2f277bb7149 |
3240414114121 has 8 divisors (see below), whose sum is σ = 3288824229600. Its totient is φ = 3192005343648.
The previous prime is 3240414114103. The next prime is 3240414114127. The reversal of 3240414114121 is 1214114140423.
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 not a de Polignac number, because 3240414114121 - 211 = 3240414112073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3240414114121.
It is not an unprimeable number, because it can be changed into a prime (3240414114127) 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, 5191965 + ... + 5782501.
It is an arithmetic number, because the mean of its divisors is an integer number (411103028700).
Almost surely, 23240414114121 is an apocalyptic number.
It is an amenable number.
3240414114121 is a deficient number, since it is larger than the sum of its proper divisors (48410115479).
3240414114121 is an equidigital number, since it uses as much as digits as its factorization.
3240414114121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672503.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 3240414114121 its reverse (1214114140423), we get a palindrome (4454528254544).
The spelling of 3240414114121 in words is "three trillion, two hundred forty billion, four hundred fourteen million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •