Base | Representation |
---|---|
bin | 10001100111111100100… |
… | …100010111110000110001 |
3 | 11021210010020222101010102 |
4 | 101213330210113300301 |
5 | 124320340014444441 |
6 | 2324214325242145 |
7 | 153333522240446 |
oct | 21477444276061 |
9 | 4253106871112 |
10 | 1211123203121 |
11 | 4276a8524247 |
12 | 176882863355 |
13 | 8a292bbb1c0 |
14 | 428939099cd |
15 | 217864b469b |
hex | 119fc917c31 |
1211123203121 has 8 divisors (see below), whose sum is σ = 1314242913984. Its totient is φ = 1109425833360.
The previous prime is 1211123203111. The next prime is 1211123203127. The reversal of 1211123203121 is 1213023211121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1211123203121 - 210 = 1211123202097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1211123203093 and 1211123203102.
It is not an unprimeable number, because it can be changed into a prime (1211123203127) 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, 355583501 + ... + 355586906.
It is an arithmetic number, because the mean of its divisors is an integer number (164280364248).
Almost surely, 21211123203121 is an apocalyptic number.
It is an amenable number.
1211123203121 is a deficient number, since it is larger than the sum of its proper divisors (103119710863).
1211123203121 is a wasteful number, since it uses less digits than its factorization.
1211123203121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711170551.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1211123203121 its reverse (1213023211121), we get a palindrome (2424146414242).
It can be divided in two parts, 121112 and 3203121, that added together give a palindrome (3324233).
The spelling of 1211123203121 in words is "one trillion, two hundred eleven billion, one hundred twenty-three million, two hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •