Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …010110100111010111000 |
3 | 10220020220222210100222212 |
4 | 100001121322310322320 |
5 | 121014342134033422 |
6 | 2201445100234252 |
7 | 142355210315060 |
oct | 20013172647270 |
9 | 3806828710885 |
10 | 1101020221112 |
11 | 394a38236239 |
12 | 15947553b988 |
13 | 7ca972753c6 |
14 | 3b40ab9a3a0 |
15 | 1d9903289e2 |
hex | 10059eb4eb8 |
1101020221112 has 16 divisors (see below), whose sum is σ = 2359329045360. Its totient is φ = 471865809024.
The previous prime is 1101020221111. The next prime is 1101020221121. The reversal of 1101020221112 is 2111220201011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101020221111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9830537633 + ... + 9830537744.
It is an arithmetic number, because the mean of its divisors is an integer number (147458065335).
Almost surely, 21101020221112 is an apocalyptic number.
It is an amenable number.
1101020221112 is an abundant number, since it is smaller than the sum of its proper divisors (1258308824248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101020221112 is a wasteful number, since it uses less digits than its factorization.
1101020221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19661075390 (or 19661075386 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1101020221112 its reverse (2111220201011), we get a palindrome (3212240422123).
The spelling of 1101020221112 in words is "one trillion, one hundred one billion, twenty million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •