Base | Representation |
---|---|
bin | 1010000011010001101011… |
… | …0110000100101010111011 |
3 | 1110010111121011010222011201 |
4 | 2200310122312010222323 |
5 | 2422031232204011011 |
6 | 35300535454235031 |
7 | 2220303011364565 |
oct | 240643266045273 |
9 | 43114534128151 |
10 | 11051401235131 |
11 | 3580966984724 |
12 | 12a5a03ab5a77 |
13 | 6221b158579a |
14 | 2a2c6801a335 |
15 | 142714089cc1 |
hex | a0d1ad84abb |
11051401235131 has 4 divisors (see below), whose sum is σ = 11057727167752. Its totient is φ = 11045075302512.
The previous prime is 11051401235117. The next prime is 11051401235159. The reversal of 11051401235131 is 13153210415011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11051401235131 - 221 = 11051399137979 is a prime.
It is a super-2 number, since 2×110514012351312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11051401235131.
It is not an unprimeable number, because it can be changed into a prime (11051401235731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3162963690 + ... + 3162967183.
It is an arithmetic number, because the mean of its divisors is an integer number (2764431791938).
Almost surely, 211051401235131 is an apocalyptic number.
11051401235131 is a deficient number, since it is larger than the sum of its proper divisors (6325932621).
11051401235131 is an equidigital number, since it uses as much as digits as its factorization.
11051401235131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6325932620.
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 11051401235131 in words is "eleven trillion, fifty-one billion, four hundred one million, two hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •