Base | Representation |
---|---|
bin | 100011100100100010011… |
… | …100100100000001010101 |
3 | 22122200110102202122121202 |
4 | 203210202130210001111 |
5 | 310022130030214331 |
6 | 5110540505522245 |
7 | 341413602522602 |
oct | 43444234440125 |
9 | 8580412678552 |
10 | 2444414304341 |
11 | 862741170429 |
12 | 3358b14a3385 |
13 | 149679655a69 |
14 | 8644b5bd6a9 |
15 | 438b8bbeecb |
hex | 23922724055 |
2444414304341 has 32 divisors (see below), whose sum is σ = 2648819712000. Its totient is φ = 2248254429120.
The previous prime is 2444414304337. The next prime is 2444414304347. The reversal of 2444414304341 is 1434034144442.
It is not a de Polignac number, because 2444414304341 - 22 = 2444414304337 is a prime.
It is a super-2 number, since 2×24444143043412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2444414304295 and 2444414304304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2444414304347) 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, 218304155 + ... + 218315351.
It is an arithmetic number, because the mean of its divisors is an integer number (82775616000).
Almost surely, 22444414304341 is an apocalyptic number.
It is an amenable number.
2444414304341 is a deficient number, since it is larger than the sum of its proper divisors (204405407659).
2444414304341 is a wasteful number, since it uses less digits than its factorization.
2444414304341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12849.
The product of its (nonzero) digits is 294912, while the sum is 38.
Adding to 2444414304341 its reverse (1434034144442), we get a palindrome (3878448448783).
The spelling of 2444414304341 in words is "two trillion, four hundred forty-four billion, four hundred fourteen million, three hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •