Base | Representation |
---|---|
bin | 10001011110100111001… |
… | …000111101110110000001 |
3 | 11020211020201120222021110 |
4 | 101132213020331312001 |
5 | 124134323101133441 |
6 | 2315435553513533 |
7 | 152530243504500 |
oct | 21364710756601 |
9 | 4224221528243 |
10 | 1201100021121 |
11 | 423424716260 |
12 | 174945b728a9 |
13 | 89356475190 |
14 | 421c2670837 |
15 | 2139b577b16 |
hex | 117a723dd81 |
1201100021121 has 192 divisors, whose sum is σ = 2253613694976. Its totient is φ = 558929548800.
The previous prime is 1201100021111. The next prime is 1201100021171. The reversal of 1201100021121 is 1211200011021.
It is not a de Polignac number, because 1201100021121 - 27 = 1201100020993 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1201100021097 and 1201100021106.
It is not an unprimeable number, because it can be changed into a prime (1201100021111) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 335220096 + ... + 335223678.
It is an arithmetic number, because the mean of its divisors is an integer number (11737571328).
Almost surely, 21201100021121 is an apocalyptic number.
1201100021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1201100021121 is a deficient number, since it is larger than the sum of its proper divisors (1052513673855).
1201100021121 is a wasteful number, since it uses less digits than its factorization.
1201100021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4092 (or 4085 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1201100021121 its reverse (1211200011021), we get a palindrome (2412300032142).
The spelling of 1201100021121 in words is "one trillion, two hundred one billion, one hundred million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •