Base | Representation |
---|---|
bin | 10000001010101101111… |
… | …101110011011000111100 |
3 | 10221012201220120001100120 |
4 | 100022231331303120330 |
5 | 121200332134101022 |
6 | 2210221243054540 |
7 | 143161055032461 |
oct | 20125575633074 |
9 | 3835656501316 |
10 | 1111020222012 |
11 | 3991a9a50998 |
12 | 15b3a6511450 |
13 | 809cbc630bc |
14 | 3bab8d1d668 |
15 | 1dd781d6d5c |
hex | 102adf7363c |
1111020222012 has 24 divisors (see below), whose sum is σ = 2705092715136. Its totient is φ = 354238331568.
The previous prime is 1111020221959. The next prime is 1111020222017. The reversal of 1111020222012 is 2102220201111.
It is a junction number, because it is equal to n+sod(n) for n = 1111020221982 and 1111020222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111020222017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2012717518 + ... + 2012718069.
It is an arithmetic number, because the mean of its divisors is an integer number (112712196464).
Almost surely, 21111020222012 is an apocalyptic number.
1111020222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1111020222012 is an abundant number, since it is smaller than the sum of its proper divisors (1594072493124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111020222012 is a wasteful number, since it uses less digits than its factorization.
1111020222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4025435617 (or 4025435615 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1111020222012 its reverse (2102220201111), we get a palindrome (3213240423123).
The spelling of 1111020222012 in words is "one trillion, one hundred eleven billion, twenty million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •