Base | Representation |
---|---|
bin | 101111110001101011011110… |
… | …011001010001100000101111 |
3 | 1000112222110220220111011201002 |
4 | 233301223132121101200233 |
5 | 210020120101013102231 |
6 | 2022520434144110515 |
7 | 62154552021150563 |
oct | 5761533631214057 |
9 | 1015873826434632 |
10 | 210122121222191 |
11 | 60a51322615082 |
12 | 1b6970a930543b |
13 | 903257ac10109 |
14 | 39c5d71aab6a3 |
15 | 1945b5a2e30cb |
hex | bf1ade65182f |
210122121222191 has 8 divisors (see below), whose sum is σ = 214251245105184. Its totient is φ = 205999091989600.
The previous prime is 210122121222179. The next prime is 210122121222199. The reversal of 210122121222191 is 191222121221012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210122121222191 is a prime.
It is a super-3 number, since 3×2101221212221913 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210122121222199) 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, 1523592971 + ... + 1523730876.
It is an arithmetic number, because the mean of its divisors is an integer number (26781405638148).
Almost surely, 2210122121222191 is an apocalyptic number.
210122121222191 is a deficient number, since it is larger than the sum of its proper divisors (4129123882993).
210122121222191 is a wasteful number, since it uses less digits than its factorization.
210122121222191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3047325201.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 210122121222191 in words is "two hundred ten trillion, one hundred twenty-two billion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •