Base | Representation |
---|---|
bin | 101101101100111100111001… |
… | …000001101101001011011011 |
3 | 222100200112001102200010101102 |
4 | 231230330321001231023123 |
5 | 202321200304043442021 |
6 | 1551254351150142015 |
7 | 60223565260355063 |
oct | 5554747101551333 |
9 | 870615042603342 |
10 | 201001131234011 |
11 | 59055112547089 |
12 | 1a6634481b190b |
13 | 882042ca22c54 |
14 | 378c7143ba3a3 |
15 | 1838779cab00b |
hex | b6cf3906d2db |
201001131234011 has 2 divisors, whose sum is σ = 201001131234012. Its totient is φ = 201001131234010.
The previous prime is 201001131233977. The next prime is 201001131234019. The reversal of 201001131234011 is 110432131100102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201001131234011 - 230 = 201000057492187 is a prime.
It is a super-2 number, since 2×2010011312340112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201001131234019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500565617005 + 100500565617006.
It is an arithmetic number, because the mean of its divisors is an integer number (100500565617006).
Almost surely, 2201001131234011 is an apocalyptic number.
201001131234011 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001131234011 is an equidigital number, since it uses as much as digits as its factorization.
201001131234011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 201001131234011 its reverse (110432131100102), we get a palindrome (311433262334113).
The spelling of 201001131234011 in words is "two hundred one trillion, one billion, one hundred thirty-one million, two hundred thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •