Base | Representation |
---|---|
bin | 1011101100111001100… |
… | …0110111100001110011 |
3 | 201012220012112001121111 |
4 | 2323032120313201303 |
5 | 11243202431333021 |
6 | 232204042334151 |
7 | 20344511222500 |
oct | 2731630674163 |
9 | 635805461544 |
10 | 201031121011 |
11 | 78290910726 |
12 | 32b64aba357 |
13 | 15c59b34656 |
14 | 9a310104a7 |
15 | 5368c518e1 |
hex | 2ece637873 |
201031121011 has 12 divisors (see below), whose sum is σ = 233975265768. Its totient is φ = 172221951552.
The previous prime is 201031120933. The next prime is 201031121033. The reversal of 201031121011 is 110121130102.
It is a happy number.
It is not a de Polignac number, because 201031121011 - 213 = 201031112819 is a prime.
It is a super-2 number, since 2×2010311210112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201031120982 and 201031121000.
It is not an unprimeable number, because it can be changed into a prime (201031181011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 982246 + ... + 1169131.
It is an arithmetic number, because the mean of its divisors is an integer number (19497938814).
Almost surely, 2201031121011 is an apocalyptic number.
201031121011 is a deficient number, since it is larger than the sum of its proper divisors (32944144757).
201031121011 is a wasteful number, since it uses less digits than its factorization.
201031121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2153298 (or 2153291 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 201031121011 its reverse (110121130102), we get a palindrome (311152251113).
Subtracting from 201031121011 its reverse (110121130102), we obtain a palindrome (90909990909).
The spelling of 201031121011 in words is "two hundred one billion, thirty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •