Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …0000011100010011010110 |
3 | 1102222202012120202122202212 |
4 | 2200033311200130103112 |
5 | 2420410310221231402 |
6 | 35230521555233422 |
7 | 2214412413305060 |
oct | 240176540342326 |
9 | 42882176678685 |
10 | 11012120102102 |
11 | 3566239792019 |
12 | 129a2808a8872 |
13 | 61b59141a0c2 |
14 | 2a0dbd0d8730 |
15 | 1416b5750952 |
hex | a03f581c4d6 |
11012120102102 has 8 divisors (see below), whose sum is σ = 18877920175056. Its totient is φ = 4719480043752.
The previous prime is 11012120102059. The next prime is 11012120102143. The reversal of 11012120102102 is 20120102121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×110121201021023 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 786580007293 = 11012120102102 / (1 + 1 + 0 + 1 + 2 + 1 + 2 + 0 + 1 + 0 + 2 + 1 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393290003633 + ... + 393290003660.
It is an arithmetic number, because the mean of its divisors is an integer number (2359740021882).
Almost surely, 211012120102102 is an apocalyptic number.
11012120102102 is a deficient number, since it is larger than the sum of its proper divisors (7865800072954).
11012120102102 is an equidigital number, since it uses as much as digits as its factorization.
11012120102102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 786580007302.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11012120102102 its reverse (20120102121011), we get a palindrome (31132222223113).
The spelling of 11012120102102 in words is "eleven trillion, twelve billion, one hundred twenty million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •