Base | Representation |
---|---|
bin | 101101101101000101001111… |
… | …100111010000011010100011 |
3 | 222100201101012111012021200001 |
4 | 231231011033213100122203 |
5 | 202321322141112023021 |
6 | 1551302433140240431 |
7 | 60224333444512402 |
oct | 5555051747203243 |
9 | 870641174167601 |
10 | 201010100111011 |
11 | 590589a5210124 |
12 | 1a66512b9a0117 |
13 | 882122bbc7069 |
14 | 378cd2560d639 |
15 | 1838b0238b091 |
hex | b6d14f9d06a3 |
201010100111011 has 4 divisors (see below), whose sum is σ = 201774397069872. Its totient is φ = 200245803152152.
The previous prime is 201010100111003. The next prime is 201010100111033. The reversal of 201010100111011 is 110111001010102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201010100111011 - 23 = 201010100111003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201010100111071) 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, 382148479036 + ... + 382148479561.
It is an arithmetic number, because the mean of its divisors is an integer number (50443599267468).
Almost surely, 2201010100111011 is an apocalyptic number.
201010100111011 is a deficient number, since it is larger than the sum of its proper divisors (764296958861).
201010100111011 is an equidigital number, since it uses as much as digits as its factorization.
201010100111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764296958860.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201010100111011 its reverse (110111001010102), we get a palindrome (311121101121113).
The spelling of 201010100111011 in words is "two hundred one trillion, ten billion, one hundred million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •