Base | Representation |
---|---|
bin | 1010001000100000010101… |
… | …0000001111100101100010 |
3 | 1110110002110201001012101121 |
4 | 2202020011100033211202 |
5 | 2430014221211410200 |
6 | 35410113435322454 |
7 | 2226633101413624 |
oct | 242100520174542 |
9 | 43402421035347 |
10 | 11141233310050 |
11 | 3605a74830158 |
12 | 12bb2b45b042a |
13 | 62a7c9670cbc |
14 | 2a734a8c4c14 |
15 | 144c207e5e1a |
hex | a220540f962 |
11141233310050 has 24 divisors (see below), whose sum is σ = 20762316747216. Its totient is φ = 4447972293840.
The previous prime is 11141233310023. The next prime is 11141233310057. The reversal of 11141233310050 is 5001333214111.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 11141233309997 and 11141233310024.
It is not an unprimeable number, because it can be changed into a prime (11141233310057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 212999344 + ... + 213051643.
It is an arithmetic number, because the mean of its divisors is an integer number (865096531134).
Almost surely, 211141233310050 is an apocalyptic number.
11141233310050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11141233310050 is a deficient number, since it is larger than the sum of its proper divisors (9621083437166).
11141233310050 is a wasteful number, since it uses less digits than its factorization.
11141233310050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426051522 (or 426051517 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 11141233310050 its reverse (5001333214111), we get a palindrome (16142566524161).
The spelling of 11141233310050 in words is "eleven trillion, one hundred forty-one billion, two hundred thirty-three million, three hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •