Base | Representation |
---|---|
bin | 10000010100000110111… |
… | …001001100100000111100 |
3 | 10222011202112102120210112 |
4 | 100110012321030200330 |
5 | 121332004120333040 |
6 | 2215005513125152 |
7 | 143665645540160 |
oct | 20240671144074 |
9 | 3864675376715 |
10 | 1121102121020 |
11 | 3a2502a13932 |
12 | 16133a9b97b8 |
13 | 819478c710b |
14 | 3c393cc0ca0 |
15 | 1e268371365 |
hex | 10506e4c83c |
1121102121020 has 48 divisors (see below), whose sum is σ = 2691648841728. Its totient is φ = 384234477120.
The previous prime is 1121102121001. The next prime is 1121102121089. The reversal of 1121102121020 is 201212011211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1121102120986 and 1121102121004.
It is a congruent number.
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, 1116716 + ... + 1867955.
It is an arithmetic number, because the mean of its divisors is an integer number (56076017536).
Almost surely, 21121102121020 is an apocalyptic number.
1121102121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121102121020 is an abundant number, since it is smaller than the sum of its proper divisors (1570546720708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121102121020 is a wasteful number, since it uses less digits than its factorization.
1121102121020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2987370 (or 2987368 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1121102121020 its reverse (201212011211), we get a palindrome (1322314132231).
The spelling of 1121102121020 in words is "one trillion, one hundred twenty-one billion, one hundred two million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •