Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010100111110010000001011 |
3 | 222100200102011110000212200112 |
4 | 231230323312110332100023 |
5 | 202321141011111224321 |
6 | 1551254044133424535 |
7 | 60223525452002663 |
oct | 5554736624762013 |
9 | 870612143025615 |
10 | 201000012211211 |
11 | 59054698919754 |
12 | 1a66319549b14b |
13 | 88202b1c41895 |
14 | 378c6499291a3 |
15 | 1838711918a5b |
hex | b6cef653e40b |
201000012211211 has 4 divisors (see below), whose sum is σ = 201005123763192. Its totient is φ = 200994900659232.
The previous prime is 201000012211121. The next prime is 201000012211253. The reversal of 201000012211211 is 112112210000102.
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 201000012211211 - 214 = 201000012194827 is a prime.
It is a super-2 number, since 2×2010000122112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201000012219211) 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, 2555717006 + ... + 2555795651.
It is an arithmetic number, because the mean of its divisors is an integer number (50251280940798).
Almost surely, 2201000012211211 is an apocalyptic number.
201000012211211 is a deficient number, since it is larger than the sum of its proper divisors (5111551981).
201000012211211 is an equidigital number, since it uses as much as digits as its factorization.
201000012211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5111551980.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201000012211211 its reverse (112112210000102), we get a palindrome (313112222211313).
The spelling of 201000012211211 in words is "two hundred one trillion, twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •