Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1101010111101110011 |
3 | 201020100001120000111202 |
4 | 2323120201222331303 |
5 | 11244030001413021 |
6 | 232233000001415 |
7 | 20351644663526 |
oct | 2733041527563 |
9 | 636301500452 |
10 | 201201201011 |
11 | 78368918308 |
12 | 32bb1a6026b |
13 | 15c861441c5 |
14 | 9a49844bbd |
15 | 5378b4aa0b |
hex | 2ed886af73 |
201201201011 has 4 divisors (see below), whose sum is σ = 201202148112. Its totient is φ = 201200253912.
The previous prime is 201201201007. The next prime is 201201201017. The reversal of 201201201011 is 110102102102.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 201201201011 - 22 = 201201201007 is a prime.
It is a super-3 number, since 3×2012012010113 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201201200983 and 201201201001.
It is not an unprimeable number, because it can be changed into a prime (201201201017) 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, 9050 + ... + 634416.
It is an arithmetic number, because the mean of its divisors is an integer number (50300537028).
Almost surely, 2201201201011 is an apocalyptic number.
201201201011 is a deficient number, since it is larger than the sum of its proper divisors (947101).
201201201011 is an equidigital number, since it uses as much as digits as its factorization.
201201201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 947100.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201201201011 its reverse (110102102102), we get a palindrome (311303303113).
The spelling of 201201201011 in words is "two hundred one billion, two hundred one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •