Base | Representation |
---|---|
bin | 10001100111111100011… |
… | …000111111101111000001 |
3 | 11021210010001100212120222 |
4 | 101213330120333233001 |
5 | 124320333234033441 |
6 | 2324214141312425 |
7 | 153333455010536 |
oct | 21477430775701 |
9 | 4253101325528 |
10 | 1211120221121 |
11 | 4276a6877888 |
12 | 176881865715 |
13 | 8a2923b5ac5 |
14 | 42893370d8d |
15 | 217860c5d4b |
hex | 119fc63fbc1 |
1211120221121 has 8 divisors (see below), whose sum is σ = 1237012819200. Its totient is φ = 1185232793248.
The previous prime is 1211120221081. The next prime is 1211120221189. The reversal of 1211120221121 is 1211220211121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1211120221121 - 210 = 1211120220097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1211120221121.
It is not an unprimeable number, because it can be changed into a prime (1211120221921) 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, 817196 + ... + 1757853.
It is an arithmetic number, because the mean of its divisors is an integer number (154626602400).
Almost surely, 21211120221121 is an apocalyptic number.
It is an amenable number.
1211120221121 is a deficient number, since it is larger than the sum of its proper divisors (25892598079).
1211120221121 is a wasteful number, since it uses less digits than its factorization.
1211120221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2585103.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1211120221121 its reverse (1211220211121), we get a palindrome (2422340432242).
The spelling of 1211120221121 in words is "one trillion, two hundred eleven billion, one hundred twenty million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •