Base | Representation |
---|---|
bin | 1010010111101000110001… |
… | …1110110110111001101111 |
3 | 1111100221111020102121011100 |
4 | 2211322030132312321233 |
5 | 2443244124211244043 |
6 | 40125350010054143 |
7 | 2254465236612063 |
oct | 245721436667157 |
9 | 44327436377140 |
10 | 11401200103023 |
11 | 36a6249258495 |
12 | 1341766a1a353 |
13 | 649189591713 |
14 | 2b5b6cc93aa3 |
15 | 14b88860dcd3 |
hex | a5e8c7b6e6f |
11401200103023 has 24 divisors (see below), whose sum is σ = 17366280562800. Its totient is φ = 7187830147584.
The previous prime is 11401200103009. The next prime is 11401200103127. The reversal of 11401200103023 is 32030100210411.
11401200103023 is a `hidden beast` number, since 1 + 1 + 401 + 200 + 10 + 30 + 23 = 666.
It is not a de Polignac number, because 11401200103023 - 29 = 11401200102511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11401200102987 and 11401200103005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401200104023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 59755458 + ... + 59945951.
It is an arithmetic number, because the mean of its divisors is an integer number (723595023450).
Almost surely, 211401200103023 is an apocalyptic number.
11401200103023 is a deficient number, since it is larger than the sum of its proper divisors (5965080459777).
11401200103023 is a wasteful number, since it uses less digits than its factorization.
11401200103023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119701991 (or 119701988 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11401200103023 its reverse (32030100210411), we get a palindrome (43431300313434).
The spelling of 11401200103023 in words is "eleven trillion, four hundred one billion, two hundred million, one hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •