Base | Representation |
---|---|
bin | 10000000001101010101… |
… | …010010011011000101001 |
3 | 10220021122120022121022012 |
4 | 100001222222103120221 |
5 | 121020431040231441 |
6 | 2201533012405305 |
7 | 142365160625123 |
oct | 20015252233051 |
9 | 3807576277265 |
10 | 1101301102121 |
11 | 395071841300 |
12 | 159533616835 |
13 | 7cb1050aa9c |
14 | 3b4361d4213 |
15 | 1d9a9d0c9eb |
hex | 1006aa93629 |
1101301102121 has 24 divisors (see below), whose sum is σ = 1236512363520. Its totient is φ = 979694369280.
The previous prime is 1101301102051. The next prime is 1101301102123. The reversal of 1101301102121 is 1212011031011.
It is not a de Polignac number, because 1101301102121 - 210 = 1101301101097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101301102096 and 1101301102105.
It is not an unprimeable number, because it can be changed into a prime (1101301102123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36023240 + ... + 36053798.
It is an arithmetic number, because the mean of its divisors is an integer number (51521348480).
Almost surely, 21101301102121 is an apocalyptic number.
1101301102121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101301102121 is a deficient number, since it is larger than the sum of its proper divisors (135211261399).
1101301102121 is a wasteful number, since it uses less digits than its factorization.
1101301102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36965 (or 36954 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101301102121 its reverse (1212011031011), we get a palindrome (2313312133132).
The spelling of 1101301102121 in words is "one trillion, one hundred one billion, three hundred one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •