Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011110011101001100111001 |
3 | 222100200112112211010002222210 |
4 | 231230331010132131030321 |
5 | 202321201202232220441 |
6 | 1551254422211205333 |
7 | 60223603112151642 |
oct | 5554750436351471 |
9 | 870615484102883 |
10 | 201001323320121 |
11 | 59055200a14235 |
12 | 1a6634a05a6849 |
13 | 882046076907c |
14 | 378c731adc6c9 |
15 | 183878baa0616 |
hex | b6cf4479d339 |
201001323320121 has 4 divisors (see below), whose sum is σ = 268001764426832. Its totient is φ = 134000882213412.
The previous prime is 201001323320101. The next prime is 201001323320137. The reversal of 201001323320121 is 121023323100102.
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 not a de Polignac number, because 201001323320121 - 29 = 201001323319609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001323320101) 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, 33500220553351 + ... + 33500220553356.
It is an arithmetic number, because the mean of its divisors is an integer number (67000441106708).
Almost surely, 2201001323320121 is an apocalyptic number.
It is an amenable number.
201001323320121 is a deficient number, since it is larger than the sum of its proper divisors (67000441106711).
201001323320121 is an equidigital number, since it uses as much as digits as its factorization.
201001323320121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67000441106710.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201001323320121 its reverse (121023323100102), we get a palindrome (322024646420223).
The spelling of 201001323320121 in words is "two hundred one trillion, one billion, three hundred twenty-three million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •