Base | Representation |
---|---|
bin | 110010011111010101111000… |
… | …0010011100100001111011101 |
3 | 2011020110201022121020200212001 |
4 | 1210332223300103210033131 |
5 | 431202313331420031023 |
6 | 4212314202502042301 |
7 | 162355023214205662 |
oct | 14476536023441735 |
9 | 2136421277220761 |
10 | 444112240002013 |
11 | 119564a41554080 |
12 | 41987b16719391 |
13 | 160a67b2206bcb |
14 | 7b9520b937a69 |
15 | 36525a28bc6ad |
hex | 193eaf04e43dd |
444112240002013 has 8 divisors (see below), whose sum is σ = 485292213254016. Its totient is φ = 403066622292000.
The previous prime is 444112240001993. The next prime is 444112240002031. The reversal of 444112240002013 is 310200042211444.
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 444112240002013 - 25 = 444112240001981 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 (444112240002043) 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, 33588878581 + ... + 33588891802.
It is an arithmetic number, because the mean of its divisors is an integer number (60661526656752).
Almost surely, 2444112240002013 is an apocalyptic number.
It is an amenable number.
444112240002013 is a deficient number, since it is larger than the sum of its proper divisors (41179973252003).
444112240002013 is a wasteful number, since it uses less digits than its factorization.
444112240002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67177770995.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 444112240002013 its reverse (310200042211444), we get a palindrome (754312282213457).
The spelling of 444112240002013 in words is "four hundred forty-four trillion, one hundred twelve billion, two hundred forty million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •