Base | Representation |
---|---|
bin | 1001011111101100100001… |
… | …0011100100001011011001 |
3 | 1100222001210200112210122010 |
4 | 2113323020103210023121 |
5 | 2332022342030221101 |
6 | 34112044030020133 |
7 | 2125163116105041 |
oct | 227731023441331 |
9 | 40861720483563 |
10 | 10440131101401 |
11 | 33656a8918921 |
12 | 120744a947649 |
13 | 5a9666a5bcc1 |
14 | 28143b068721 |
15 | 131889abd2d6 |
hex | 97ec84e42d9 |
10440131101401 has 8 divisors (see below), whose sum is σ = 13920191110944. Its totient is φ = 6960079246400.
The previous prime is 10440131101333. The next prime is 10440131101423. The reversal of 10440131101401 is 10410113104401.
10440131101401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10440131101401 - 217 = 10440130970329 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10440131101451) 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, 2218945 + ... + 5079761.
It is an arithmetic number, because the mean of its divisors is an integer number (1740023888868).
Almost surely, 210440131101401 is an apocalyptic number.
It is an amenable number.
10440131101401 is a deficient number, since it is larger than the sum of its proper divisors (3480060009543).
10440131101401 is a wasteful number, since it uses less digits than its factorization.
10440131101401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4077271.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 10440131101401 its reverse (10410113104401), we get a palindrome (20850244205802).
The spelling of 10440131101401 in words is "ten trillion, four hundred forty billion, one hundred thirty-one million, one hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •