Base | Representation |
---|---|
bin | 11101000111110010101… |
… | …011001100001101100001 |
3 | 21002022112020120100101121 |
4 | 131013302223030031201 |
5 | 230242010141413441 |
6 | 4131204121532241 |
7 | 264404242353505 |
oct | 35076253141541 |
9 | 7068466510347 |
10 | 2001231201121 |
11 | 701798928479 |
12 | 283a28344081 |
13 | 11693b661449 |
14 | 6cc081c2305 |
15 | 370cb12cdd1 |
hex | 1d1f2acc361 |
2001231201121 has 4 divisors (see below), whose sum is σ = 2003172260544. Its totient is φ = 1999290141700.
The previous prime is 2001231201029. The next prime is 2001231201149. The reversal of 2001231201121 is 1211021321002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2001231201121 - 227 = 2001096983393 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001231201095 and 2001231201104.
It is not an unprimeable number, because it can be changed into a prime (2001231204121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 970528165 + ... + 970530226.
It is an arithmetic number, because the mean of its divisors is an integer number (500793065136).
Almost surely, 22001231201121 is an apocalyptic number.
It is an amenable number.
2001231201121 is a deficient number, since it is larger than the sum of its proper divisors (1941059423).
2001231201121 is a wasteful number, since it uses less digits than its factorization.
2001231201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941059422.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2001231201121 its reverse (1211021321002), we get a palindrome (3212252522123).
The spelling of 2001231201121 in words is "two trillion, one billion, two hundred thirty-one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •