Base | Representation |
---|---|
bin | 100010111111010100000… |
… | …001111100111100111001 |
3 | 22111212021211120210222121 |
4 | 202333110001330330321 |
5 | 303343300131000212 |
6 | 5040330351321241 |
7 | 335500235532331 |
oct | 42772401747471 |
9 | 8455254523877 |
10 | 2404444000057 |
11 | 84779aa55200 |
12 | 329bb7520221 |
13 | 14597979cb38 |
14 | 84538d420c1 |
15 | 42829b01d07 |
hex | 22fd407cf39 |
2404444000057 has 12 divisors (see below), whose sum is σ = 2642975310528. Its totient is φ = 2185796934200.
The previous prime is 2404444000019. The next prime is 2404444000081. The reversal of 2404444000057 is 7500004444042.
It is not a de Polignac number, because 2404444000057 - 27 = 2404443999929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2404443999986 and 2404444000031.
It is not an unprimeable number, because it can be changed into a prime (2404444000157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4378332 + ... + 4896802.
It is an arithmetic number, because the mean of its divisors is an integer number (220247942544).
Almost surely, 22404444000057 is an apocalyptic number.
It is an amenable number.
2404444000057 is a deficient number, since it is larger than the sum of its proper divisors (238531310471).
2404444000057 is a wasteful number, since it uses less digits than its factorization.
2404444000057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556820 (or 556809 counting only the distinct ones).
The product of its (nonzero) digits is 71680, while the sum is 34.
Adding to 2404444000057 its reverse (7500004444042), we get a palindrome (9904448444099).
The spelling of 2404444000057 in words is "two trillion, four hundred four billion, four hundred forty-four million, fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •