Base | Representation |
---|---|
bin | 1001011111110011100001… |
… | …0110111001110000010001 |
3 | 1100222020122200221210011220 |
4 | 2113330320112321300101 |
5 | 2332040214310240101 |
6 | 34112554343155253 |
7 | 2125260524145105 |
oct | 227747026716021 |
9 | 40866580853156 |
10 | 10442011024401 |
11 | 33664830008a0 |
12 | 1207894445b29 |
13 | 5a98a6383388 |
14 | 2815789c7905 |
15 | 131949b62636 |
hex | 97f385b9c11 |
10442011024401 has 64 divisors (see below), whose sum is σ = 16149881537280. Its totient is φ = 5940294312960.
The previous prime is 10442011024399. The next prime is 10442011024409.
10442011024401 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10442011024401 - 21 = 10442011024399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10442011024409) 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 63 ways as a sum of consecutive naturals, for example, 43681735 + ... + 43920131.
It is an arithmetic number, because the mean of its divisors is an integer number (252341899020).
Almost surely, 210442011024401 is an apocalyptic number.
10442011024401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10442011024401 is a deficient number, since it is larger than the sum of its proper divisors (5707870512879).
10442011024401 is a wasteful number, since it uses less digits than its factorization.
10442011024401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239714.
The product of its (nonzero) digits is 1024, while the sum is 24.
It can be divided in two parts, 1044201 and 1024401, that added together give a palindrome (2068602).
The spelling of 10442011024401 in words is "ten trillion, four hundred forty-two billion, eleven million, twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •