Base | Representation |
---|---|
bin | 100011100001011110010… |
… | …111100010110000110110 |
3 | 22122100222011201002220012 |
4 | 203201132113202300312 |
5 | 304443410402413014 |
6 | 5105234233140222 |
7 | 341236226124635 |
oct | 43413627426066 |
9 | 8570864632805 |
10 | 2441124654134 |
11 | 861303255551 |
12 | 33513385a672 |
13 | 149273c5858a |
14 | 8621873951c |
15 | 43774eb3c3e |
hex | 2385e5e2c36 |
2441124654134 has 8 divisors (see below), whose sum is σ = 3661969057200. Its totient is φ = 1220468301736.
The previous prime is 2441124654109. The next prime is 2441124654169. The reversal of 2441124654134 is 4314564211442.
2441124654134 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×24411246541342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2441124654091 and 2441124654100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46980209 + ... + 47032140.
It is an arithmetic number, because the mean of its divisors is an integer number (457746132150).
Almost surely, 22441124654134 is an apocalyptic number.
2441124654134 is a deficient number, since it is larger than the sum of its proper divisors (1220844403066).
2441124654134 is a wasteful number, since it uses less digits than its factorization.
2441124654134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94025334.
The product of its digits is 368640, while the sum is 41.
Adding to 2441124654134 its reverse (4314564211442), we get a palindrome (6755688865576).
The spelling of 2441124654134 in words is "two trillion, four hundred forty-one billion, one hundred twenty-four million, six hundred fifty-four thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •