Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0001100000010010110100 |
3 | 1110022100012110212200210010 |
4 | 2201203202301200102310 |
5 | 2423343344012333022 |
6 | 35340104412100220 |
7 | 2224043624666403 |
oct | 241434261402264 |
9 | 43270173780703 |
10 | 11102000121012 |
11 | 35a0371704589 |
12 | 12b3785464670 |
13 | 626bb6420c48 |
14 | 2a54a80c363a |
15 | 143bc62cc50c |
hex | a18e2c604b4 |
11102000121012 has 24 divisors (see below), whose sum is σ = 25904725403200. Its totient is φ = 3700658356416.
The previous prime is 11102000120989. The next prime is 11102000121013. The reversal of 11102000121012 is 21012100020111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102000121013) 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 7 ways as a sum of consecutive naturals, for example, 6935664 + ... + 8384952.
Almost surely, 211102000121012 is an apocalyptic number.
11102000121012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11102000121012 is an abundant number, since it is smaller than the sum of its proper divisors (14802725282188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102000121012 is a wasteful number, since it uses less digits than its factorization.
11102000121012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2087655 (or 2087653 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11102000121012 its reverse (21012100020111), we get a palindrome (32114100141123).
The spelling of 11102000121012 in words is "eleven trillion, one hundred two billion, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •