Base | Representation |
---|---|
bin | 11101011011100010111… |
… | …10010111111000100000 |
3 | 10120200010201220110210120 |
4 | 32231301132113320200 |
5 | 113031440100231422 |
6 | 2052314253400240 |
7 | 133026000355314 |
oct | 16556136277040 |
9 | 3520121813716 |
10 | 1011221102112 |
11 | 35a946a4a001 |
12 | 143b93a99080 |
13 | 74485c58430 |
14 | 36d2c82db44 |
15 | 1b48692c45c |
hex | eb71797e20 |
1011221102112 has 96 divisors (see below), whose sum is σ = 2950858713600. Its totient is φ = 301108008960.
The previous prime is 1011221102083. The next prime is 1011221102123. The reversal of 1011221102112 is 2112011221101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 1011221102091 and 1011221102100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13030237 + ... + 13107612.
It is an arithmetic number, because the mean of its divisors is an integer number (30738111600).
Almost surely, 21011221102112 is an apocalyptic number.
1011221102112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011221102112 is an abundant number, since it is smaller than the sum of its proper divisors (1939637611488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011221102112 is a wasteful number, since it uses less digits than its factorization.
1011221102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26137906 (or 26137898 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1011221102112 its reverse (2112011221101), we get a palindrome (3123232323213).
The spelling of 1011221102112 in words is "one trillion, eleven billion, two hundred twenty-one million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •