Base | Representation |
---|---|
bin | 101011111110101001001… |
… | …101111101111011011001 |
3 | 101200220211101101221200121 |
4 | 223332221031331323121 |
5 | 344003431430120441 |
6 | 10232214024233241 |
7 | 431226646546213 |
oct | 53765115757331 |
9 | 11626741357617 |
10 | 3022201020121 |
11 | a65787761798 |
12 | 40988100b821 |
13 | 18bcb92055ba |
14 | a63bd6435b3 |
15 | 5393382ddd1 |
hex | 2bfa937ded9 |
3022201020121 has 8 divisors (see below), whose sum is σ = 3122593032384. Its totient is φ = 2923415280240.
The previous prime is 3022201020103. The next prime is 3022201020187. The reversal of 3022201020121 is 1210201022203.
It is a happy number.
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 3022201020121 - 219 = 3022200495833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022201020095 and 3022201020104.
It is not an unprimeable number, because it can be changed into a prime (3022201020821) 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, 401564271 + ... + 401571796.
It is an arithmetic number, because the mean of its divisors is an integer number (390324129048).
Almost surely, 23022201020121 is an apocalyptic number.
It is an amenable number.
3022201020121 is a deficient number, since it is larger than the sum of its proper divisors (100392012263).
3022201020121 is an equidigital number, since it uses as much as digits as its factorization.
3022201020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 803136191.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 3022201020121 its reverse (1210201022203), we get a palindrome (4232402042324).
The spelling of 3022201020121 in words is "three trillion, twenty-two billion, two hundred one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •