Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …1001101001101011011100 |
3 | 1110000111120120202201020010 |
4 | 2200113023321221223130 |
5 | 2421022441033031022 |
6 | 35234305034123220 |
7 | 2215112112325446 |
oct | 240271371515334 |
9 | 43014516681203 |
10 | 11020012002012 |
11 | 3569619536252 |
12 | 129b903880510 |
13 | 61c24b441870 |
14 | 2a152b2a3496 |
15 | 1419c84e650c |
hex | a05cbe69adc |
11020012002012 has 48 divisors (see below), whose sum is σ = 28335296232320. Its totient is φ = 3311917737408.
The previous prime is 11020012001981. The next prime is 11020012002047. The reversal of 11020012002012 is 21020021002011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 821401462 + ... + 821414877.
Almost surely, 211020012002012 is an apocalyptic number.
11020012002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11020012002012 is an abundant number, since it is smaller than the sum of its proper divisors (17315284230308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020012002012 is a wasteful number, since it uses less digits than its factorization.
11020012002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1642816402 (or 1642816400 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11020012002012 its reverse (21020021002011), we get a palindrome (32040033004023).
It can be divided in two parts, 1102001 and 2002012, that added together give a palindrome (3104013).
The spelling of 11020012002012 in words is "eleven trillion, twenty billion, twelve million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •