Base | Representation |
---|---|
bin | 1010000000010010101011… |
… | …1001101100010110101010 |
3 | 1102221121021001011210000002 |
4 | 2200010222321230112222 |
5 | 2420211232014341020 |
6 | 35221220155343002 |
7 | 2213506333600460 |
oct | 240045271542652 |
9 | 42847231153002 |
10 | 11000131012010 |
11 | 35611472021a8 |
12 | 1297a95751a62 |
13 | 61a40060535a |
14 | 2a05a2b1a830 |
15 | 141212e37975 |
hex | a012ae6c5aa |
11000131012010 has 32 divisors (see below), whose sum is σ = 23819832570240. Its totient is φ = 3572974884672.
The previous prime is 11000131011971. The next prime is 11000131012021. The reversal of 11000131012010 is 1021013100011.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11000131011982 and 11000131012000.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4135386269 + ... + 4135388928.
It is an arithmetic number, because the mean of its divisors is an integer number (744369767820).
Almost surely, 211000131012010 is an apocalyptic number.
11000131012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000131012010 is an abundant number, since it is smaller than the sum of its proper divisors (12819701558230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000131012010 is a wasteful number, since it uses less digits than its factorization.
11000131012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8270775230.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11000131012010 its reverse (1021013100011), we get a palindrome (12021144112021).
The spelling of 11000131012010 in words is "eleven trillion, one hundred thirty-one million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •