Base | Representation |
---|---|
bin | 1010000011010001000101… |
… | …1110011001001000011101 |
3 | 1110010111012012100020202120 |
4 | 2200310101132121020131 |
5 | 2422030421433020131 |
6 | 35300512121013153 |
7 | 2220266062236156 |
oct | 240642136311035 |
9 | 43114165306676 |
10 | 11051244032541 |
11 | 3580896173029 |
12 | 12a597b3241b9 |
13 | 622187b343bb |
14 | 2a2c511b892d |
15 | 142705386496 |
hex | a0d1179921d |
11051244032541 has 8 divisors (see below), whose sum is σ = 14865390203520. Its totient is φ = 7302296941632.
The previous prime is 11051244032531. The next prime is 11051244032561. The reversal of 11051244032541 is 14523044215011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11051244032541 - 25 = 11051244032509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051244032501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16299769621 + ... + 16299770298.
It is an arithmetic number, because the mean of its divisors is an integer number (1858173775440).
Almost surely, 211051244032541 is an apocalyptic number.
It is an amenable number.
11051244032541 is a deficient number, since it is larger than the sum of its proper divisors (3814146170979).
11051244032541 is a wasteful number, since it uses less digits than its factorization.
11051244032541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32599540035.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 11051244032541 its reverse (14523044215011), we get a palindrome (25574288247552).
The spelling of 11051244032541 in words is "eleven trillion, fifty-one billion, two hundred forty-four million, thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •