Base | Representation |
---|---|
bin | 1010110011110111100… |
… | …10100101000101010101 |
3 | 1022111202120111111202011 |
4 | 11121323302211011111 |
5 | 22041204133402432 |
6 | 442350010544221 |
7 | 35556505165216 |
oct | 5317362450525 |
9 | 1274676444664 |
10 | 371444044117 |
11 | 13358a530063 |
12 | 5bba3a38071 |
13 | 290474a6223 |
14 | 13d9985340d |
15 | 99de964847 |
hex | 567bca5155 |
371444044117 has 4 divisors (see below), whose sum is σ = 371471231980. Its totient is φ = 371416856256.
The previous prime is 371444044093. The next prime is 371444044129. The reversal of 371444044117 is 711440444173.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 103160446596 + 268283597521 = 321186^2 + 517961^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-371444044117 is a prime.
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 371444044117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (371444044217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13573428 + ... + 13600765.
It is an arithmetic number, because the mean of its divisors is an integer number (92867807995).
Almost surely, 2371444044117 is an apocalyptic number.
It is an amenable number.
371444044117 is a deficient number, since it is larger than the sum of its proper divisors (27187863).
371444044117 is a wasteful number, since it uses less digits than its factorization.
371444044117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27187862.
The product of its (nonzero) digits is 150528, while the sum is 40.
The spelling of 371444044117 in words is "three hundred seventy-one billion, four hundred forty-four million, forty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •