Base | Representation |
---|---|
bin | 101100010011000100010… |
… | …010011101110000111101 |
3 | 101210000102122200120212121 |
4 | 230103010102131300331 |
5 | 344333334241123123 |
6 | 10250242023002541 |
7 | 432634244145526 |
oct | 54230422356075 |
9 | 11700378616777 |
10 | 3044130020413 |
11 | a74010044229 |
12 | 411b80b99451 |
13 | 1910a2428a11 |
14 | a749dbc184d |
15 | 542b8ad575d |
hex | 2c4c449dc3d |
3044130020413 has 8 divisors (see below), whose sum is σ = 3223221066432. Its totient is φ = 2865041704896.
The previous prime is 3044130020357. The next prime is 3044130020417. The reversal of 3044130020413 is 3140200314403.
3044130020413 is digitally balanced in base 3, 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 cyclic number.
It is not a de Polignac number, because 3044130020413 - 213 = 3044130012221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3044130020417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1889656 + ... + 3107902.
It is an arithmetic number, because the mean of its divisors is an integer number (402902633304).
Almost surely, 23044130020413 is an apocalyptic number.
It is an amenable number.
3044130020413 is a deficient number, since it is larger than the sum of its proper divisors (179091046019).
3044130020413 is a wasteful number, since it uses less digits than its factorization.
3044130020413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1365251.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 3044130020413 its reverse (3140200314403), we get a palindrome (6184330334816).
The spelling of 3044130020413 in words is "three trillion, forty-four billion, one hundred thirty million, twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •