Base | Representation |
---|---|
bin | 1001011111110001110101… |
… | …1101000001011101001101 |
3 | 1100222012111020121021122120 |
4 | 2113330131131001131031 |
5 | 2332033303232101411 |
6 | 34112441500403153 |
7 | 2125243403366154 |
oct | 227743535013515 |
9 | 40865436537576 |
10 | 10441559643981 |
11 | 3366271232024 |
12 | 12077892464b9 |
13 | 5a98339c227b |
14 | 281534a8a59b |
15 | 131920200106 |
hex | 97f1d74174d |
10441559643981 has 8 divisors (see below), whose sum is σ = 13923793466400. Its totient is φ = 6960182792112.
The previous prime is 10441559643973. The next prime is 10441559644037. The reversal of 10441559643981 is 18934695514401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10441559643981 - 23 = 10441559643973 is a prime.
It is a super-2 number, since 2×104415596439812 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10441559643901) 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, 214214206 + ... + 214262943.
It is an arithmetic number, because the mean of its divisors is an integer number (1740474183300).
Almost surely, 210441559643981 is an apocalyptic number.
It is an amenable number.
10441559643981 is a deficient number, since it is larger than the sum of its proper divisors (3482233822419).
10441559643981 is an equidigital number, since it uses as much as digits as its factorization.
10441559643981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428485275.
The product of its (nonzero) digits is 18662400, while the sum is 60.
The spelling of 10441559643981 in words is "ten trillion, four hundred forty-one billion, five hundred fifty-nine million, six hundred forty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •