Base | Representation |
---|---|
bin | 1100111011001101001… |
… | …11101100101111101101 |
3 | 1120110022022201212200012 |
4 | 12131212213230233231 |
5 | 24234010422030123 |
6 | 540003535143005 |
7 | 44041202613413 |
oct | 6354647545755 |
9 | 1513268655605 |
10 | 444103314413 |
11 | 16138581a280 |
12 | 720a1374a65 |
13 | 32b568465a5 |
14 | 176cd6d92b3 |
15 | b843762378 |
hex | 67669ecbed |
444103314413 has 16 divisors (see below), whose sum is σ = 487332052992. Its totient is φ = 401353302000.
The previous prime is 444103314401. The next prime is 444103314449. The reversal of 444103314413 is 314413301444.
It is a cyclic number.
It is not a de Polignac number, because 444103314413 - 236 = 375383837677 is a prime.
It is a super-2 number, since 2×4441033144132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 444103314413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (444103314013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3173348 + ... + 3310338.
It is an arithmetic number, because the mean of its divisors is an integer number (30458253312).
Almost surely, 2444103314413 is an apocalyptic number.
It is an amenable number.
444103314413 is a deficient number, since it is larger than the sum of its proper divisors (43228738579).
444103314413 is a wasteful number, since it uses less digits than its factorization.
444103314413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138736.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 444103314413 its reverse (314413301444), we get a palindrome (758516615857).
The spelling of 444103314413 in words is "four hundred forty-four billion, one hundred three million, three hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •