Base | Representation |
---|---|
bin | 1010011000111011000111… |
… | …1011001001110110011100 |
3 | 1111110001112122010220022201 |
4 | 2212032301323021312130 |
5 | 2444124411044123030 |
6 | 40143443142221244 |
7 | 2256210046243531 |
oct | 246166173116634 |
9 | 44401478126281 |
10 | 11423303114140 |
11 | 3704660891925 |
12 | 1345ab5124824 |
13 | 64b29c86c918 |
14 | 2b6c685aad88 |
15 | 14c22dcd92ca |
hex | a63b1ec9d9c |
11423303114140 has 12 divisors (see below), whose sum is σ = 23988936539736. Its totient is φ = 4569321245648.
The previous prime is 11423303114137. The next prime is 11423303114183. The reversal of 11423303114140 is 4141130332411.
It is a junction number, because it is equal to n+sod(n) for n = 11423303114099 and 11423303114108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285582577834 + ... + 285582577873.
It is an arithmetic number, because the mean of its divisors is an integer number (1999078044978).
Almost surely, 211423303114140 is an apocalyptic number.
11423303114140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11423303114140 is an abundant number, since it is smaller than the sum of its proper divisors (12565633425596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11423303114140 is a wasteful number, since it uses less digits than its factorization.
11423303114140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 571165155716 (or 571165155714 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 11423303114140 its reverse (4141130332411), we get a palindrome (15564433446551).
The spelling of 11423303114140 in words is "eleven trillion, four hundred twenty-three billion, three hundred three million, one hundred fourteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •