Base | Representation |
---|---|
bin | 1001001010001011111110… |
… | …11110101110010110001111 |
3 | 2122022111001200012211010220 |
4 | 10211011333132232112033 |
5 | 10114443230021132120 |
6 | 110500431430202423 |
7 | 4146104466510225 |
oct | 445057736562617 |
9 | 78274050184126 |
10 | 20141240411535 |
11 | 6465941149781 |
12 | 23136107b3413 |
13 | b31406b49149 |
14 | 4d8bac4d8b15 |
15 | 24ddbe926b40 |
hex | 12517f7ae58f |
20141240411535 has 32 divisors (see below), whose sum is σ = 33153666856128. Its totient is φ = 10435016417280.
The previous prime is 20141240411533. The next prime is 20141240411549. The reversal of 20141240411535 is 53511404214102.
It is not a de Polignac number, because 20141240411535 - 21 = 20141240411533 is a prime.
It is a super-2 number, since 2×201412404115352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20141240411496 and 20141240411505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20141240411533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 70135642 + ... + 70422231.
It is an arithmetic number, because the mean of its divisors is an integer number (1036052089254).
Almost surely, 220141240411535 is an apocalyptic number.
20141240411535 is a deficient number, since it is larger than the sum of its proper divisors (13012426444593).
20141240411535 is a wasteful number, since it uses less digits than its factorization.
20141240411535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140558155.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 20141240411535 its reverse (53511404214102), we get a palindrome (73652644625637).
The spelling of 20141240411535 in words is "twenty trillion, one hundred forty-one billion, two hundred forty million, four hundred eleven thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •