Base | Representation |
---|---|
bin | 1010000000010010101001… |
… | …1011100001101100001100 |
3 | 1102221121020111022000021021 |
4 | 2200010222123201230030 |
5 | 2420211223003312022 |
6 | 35221215314043524 |
7 | 2213506206433210 |
oct | 240045233415414 |
9 | 42847214260237 |
10 | 11000123104012 |
11 | 35611427a0869 |
12 | 1297a92b795a4 |
13 | 61a3cba96a73 |
14 | 2a05a1a5c940 |
15 | 1412123c47c7 |
hex | a012a6e1b0c |
11000123104012 has 96 divisors (see below), whose sum is σ = 22164415257600. Its totient is φ = 4679313408000.
The previous prime is 11000123104007. The next prime is 11000123104027. The reversal of 11000123104012 is 21040132100011.
It is a super-2 number, since 2×110001231040122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4759896337 + ... + 4759898647.
It is an arithmetic number, because the mean of its divisors is an integer number (230879325600).
Almost surely, 211000123104012 is an apocalyptic number.
It is an amenable number.
11000123104012 is an abundant number, since it is smaller than the sum of its proper divisors (11164292153588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000123104012 is a wasteful number, since it uses less digits than its factorization.
11000123104012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4583 (or 4581 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11000123104012 its reverse (21040132100011), we get a palindrome (32040255204023).
It can be divided in two parts, 1100012 and 3104012, that added together give a palindrome (4204024).
The spelling of 11000123104012 in words is "eleven trillion, one hundred twenty-three million, one hundred four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •