Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011110011011001110001011 |
3 | 222100200112112211002200212102 |
4 | 231230331010132123032023 |
5 | 202321201202231441021 |
6 | 1551254422211104015 |
7 | 60223603112116205 |
oct | 5554750436331613 |
9 | 870615484080772 |
10 | 201001323312011 |
11 | 59055200a09132 |
12 | 1a6634a05a200b |
13 | 8820460765481 |
14 | 378c731ad9775 |
15 | 183878ba9d00b |
hex | b6cf4479b38b |
201001323312011 has 8 divisors (see below), whose sum is σ = 201051320806080. Its totient is φ = 200951327670912.
The previous prime is 201001323311989. The next prime is 201001323312029. The reversal of 201001323312011 is 110213323100102.
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 201001323312011 - 238 = 200726445405067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001323312311) 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, 230805251 + ... + 231674483.
It is an arithmetic number, because the mean of its divisors is an integer number (25131415100760).
Almost surely, 2201001323312011 is an apocalyptic number.
201001323312011 is a deficient number, since it is larger than the sum of its proper divisors (49997494069).
201001323312011 is an equidigital number, since it uses as much as digits as its factorization.
201001323312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926485.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 201001323312011 its reverse (110213323100102), we get a palindrome (311214646412113).
The spelling of 201001323312011 in words is "two hundred one trillion, one billion, three hundred twenty-three million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •