Base | Representation |
---|---|
bin | 10000000010100000110… |
… | …101110110111100011100 |
3 | 10220100222220202112101002 |
4 | 100002200311312330130 |
5 | 121024311241213040 |
6 | 2202203123405432 |
7 | 142426536163520 |
oct | 20024065667434 |
9 | 3810886675332 |
10 | 1102210101020 |
11 | 39549895a666 |
12 | 159747b23878 |
13 | 7cc26935462 |
14 | 3b4c0c13d80 |
15 | 1da0ea15a15 |
hex | 100a0d76f1c |
1102210101020 has 24 divisors (see below), whose sum is σ = 2645304242784. Its totient is φ = 377900606016.
The previous prime is 1102210100987. The next prime is 1102210101023. The reversal of 1102210101020 is 201010122011.
It is a junction number, because it is equal to n+sod(n) for n = 1102210100992 and 1102210101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102210101023) 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, 3936464507 + ... + 3936464786.
It is an arithmetic number, because the mean of its divisors is an integer number (110221010116).
Almost surely, 21102210101020 is an apocalyptic number.
1102210101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102210101020 is an abundant number, since it is smaller than the sum of its proper divisors (1543094141764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102210101020 is a wasteful number, since it uses less digits than its factorization.
1102210101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7872929309 (or 7872929307 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1102210101020 its reverse (201010122011), we get a palindrome (1303220223031).
The spelling of 1102210101020 in words is "one trillion, one hundred two billion, two hundred ten million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •