Base | Representation |
---|---|
bin | 1010001000100000010101… |
… | …0000001111100101100011 |
3 | 1110110002110201001012101122 |
4 | 2202020011100033211203 |
5 | 2430014221211410201 |
6 | 35410113435322455 |
7 | 2226633101413625 |
oct | 242100520174543 |
9 | 43402421035348 |
10 | 11141233310051 |
11 | 3605a74830159 |
12 | 12bb2b45b042b |
13 | 62a7c9670cc0 |
14 | 2a734a8c4c15 |
15 | 144c207e5e1b |
hex | a220540f963 |
11141233310051 has 16 divisors (see below), whose sum is σ = 12629919889440. Its totient is φ = 9742800683520.
The previous prime is 11141233310023. The next prime is 11141233310057. The reversal of 11141233310051 is 15001333214111.
It is a cyclic number.
It is not a de Polignac number, because 11141233310051 - 214 = 11141233293667 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11141233310051.
It is not an unprimeable number, because it can be changed into a prime (11141233310057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19265861 + ... + 19835721.
It is an arithmetic number, because the mean of its divisors is an integer number (789369993090).
Almost surely, 211141233310051 is an apocalyptic number.
11141233310051 is a deficient number, since it is larger than the sum of its proper divisors (1488686579389).
11141233310051 is a wasteful number, since it uses less digits than its factorization.
11141233310051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649046.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 11141233310051 its reverse (15001333214111), we get a palindrome (26142566524162).
The spelling of 11141233310051 in words is "eleven trillion, one hundred forty-one billion, two hundred thirty-three million, three hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •