Base | Representation |
---|---|
bin | 100011100000111010011… |
… | …001010101010000000101 |
3 | 22122022102010002120200010 |
4 | 203200322121111100011 |
5 | 304441141403041201 |
6 | 5105054313540433 |
7 | 341215250304063 |
oct | 43407231252005 |
9 | 8568363076603 |
10 | 2440521143301 |
11 | 86102361996a |
12 | 334ba5714719 |
13 | 1491a8c00987 |
14 | 8619c51b033 |
15 | 4373c000bd6 |
hex | 2383a655405 |
2440521143301 has 16 divisors (see below), whose sum is σ = 3460487227200. Its totient is φ = 1524620444928.
The previous prime is 2440521143299. The next prime is 2440521143311. The reversal of 2440521143301 is 1033411250442.
It is not a de Polignac number, because 2440521143301 - 21 = 2440521143299 is a prime.
It is a super-2 number, since 2×24405211433012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2440521143311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104471631 + ... + 104494988.
It is an arithmetic number, because the mean of its divisors is an integer number (216280451700).
Almost surely, 22440521143301 is an apocalyptic number.
It is an amenable number.
2440521143301 is a deficient number, since it is larger than the sum of its proper divisors (1019966083899).
2440521143301 is a wasteful number, since it uses less digits than its factorization.
2440521143301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208966868.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 2440521143301 its reverse (1033411250442), we get a palindrome (3473932393743).
The spelling of 2440521143301 in words is "two trillion, four hundred forty billion, five hundred twenty-one million, one hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •