Base | Representation |
---|---|
bin | 101110111101111111100010… |
… | …1011010100110011010000000 |
3 | 2000011210211212120110221000011 |
4 | 1131323333011122212122000 |
5 | 413122343231340113034 |
6 | 4022402044123234304 |
7 | 153010263002442142 |
oct | 13573770532463200 |
9 | 2004724776427004 |
10 | 413140511254144 |
11 | 10a7039a8063313 |
12 | 3a405495378994 |
13 | 1496aca19908ab |
14 | 7404170b42c92 |
15 | 32b6aed324864 |
hex | 177bfc56a6680 |
413140511254144 has 64 divisors (see below), whose sum is σ = 833483103552000. Its totient is φ = 203952666258432.
The previous prime is 413140511254103. The next prime is 413140511254181. The reversal of 413140511254144 is 441452115041314.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 413140511254097 and 413140511254106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 880712842 + ... + 881181814.
It is an arithmetic number, because the mean of its divisors is an integer number (13023173493000).
Almost surely, 2413140511254144 is an apocalyptic number.
It is an amenable number.
413140511254144 is an abundant number, since it is smaller than the sum of its proper divisors (420342592297856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413140511254144 is an equidigital number, since it uses as much as digits as its factorization.
413140511254144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556185 (or 556173 counting only the distinct ones).
The product of its (nonzero) digits is 153600, while the sum is 40.
Adding to 413140511254144 its reverse (441452115041314), we get a palindrome (854592626295458).
The spelling of 413140511254144 in words is "four hundred thirteen trillion, one hundred forty billion, five hundred eleven million, two hundred fifty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •