Base | Representation |
---|---|
bin | 10000001010111001111… |
… | …100000110010111000100 |
3 | 10221020020220112210220212 |
4 | 100022321330012113010 |
5 | 121201240100231040 |
6 | 2210253220414552 |
7 | 143166044343461 |
oct | 20127174062704 |
9 | 3836226483825 |
10 | 1111221102020 |
11 | 3992a2385027 |
12 | 15b441847458 |
13 | 80a31767b03 |
14 | 3bad7890668 |
15 | 1dd8ab66d65 |
hex | 102b9f065c4 |
1111221102020 has 24 divisors (see below), whose sum is σ = 2338026218304. Its totient is φ = 443638554336.
The previous prime is 1111221101999. The next prime is 1111221102023. The reversal of 1111221102020 is 202011221111.
It is a junction number, because it is equal to n+sod(n) for n = 1111221101986 and 1111221102004.
It is not an unprimeable number, because it can be changed into a prime (1111221102023) 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, 53107184 + ... + 53128103.
It is an arithmetic number, because the mean of its divisors is an integer number (97417759096).
Almost surely, 21111221102020 is an apocalyptic number.
1111221102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111221102020 is an abundant number, since it is smaller than the sum of its proper divisors (1226805116284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111221102020 is a wasteful number, since it uses less digits than its factorization.
1111221102020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106235819 (or 106235817 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1111221102020 its reverse (202011221111), we get a palindrome (1313232323131).
The spelling of 1111221102020 in words is "one trillion, one hundred eleven billion, two hundred twenty-one million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •