Base | Representation |
---|---|
bin | 1010000000010010011000… |
… | …1000011111101001100010 |
3 | 1102221121001110122001110101 |
4 | 2200010212020133221202 |
5 | 2420211101024143200 |
6 | 35221204220453014 |
7 | 2213504342551111 |
oct | 240044610375142 |
9 | 42847043561411 |
10 | 11000051006050 |
11 | 3561106027577 |
12 | 1297a729aa16a |
13 | 61a3b9b72352 |
14 | 2a0596251c78 |
15 | 14120add226a |
hex | a012621fa62 |
11000051006050 has 48 divisors (see below), whose sum is σ = 21539218901760. Its totient is φ = 4167999685440.
The previous prime is 11000051006047. The next prime is 11000051006051. The reversal of 11000051006050 is 5060015000011.
It is a super-2 number, since 2×110000510060502 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (11000051006051) 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 23 ways as a sum of consecutive naturals, for example, 8449039 + ... + 9663661.
It is an arithmetic number, because the mean of its divisors is an integer number (448733727120).
Almost surely, 211000051006050 is an apocalyptic number.
11000051006050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000051006050 is a deficient number, since it is larger than the sum of its proper divisors (10539167895710).
11000051006050 is a wasteful number, since it uses less digits than its factorization.
11000051006050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224187 (or 1224182 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 11000051006050 its reverse (5060015000011), we get a palindrome (16060066006061).
The spelling of 11000051006050 in words is "eleven trillion, fifty-one million, six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •