Base | Representation |
---|---|
bin | 101101101100111011111011… |
… | …100100101010101000010101 |
3 | 222100200102101120121202000011 |
4 | 231230323323210222220111 |
5 | 202321141201123224341 |
6 | 1551254100555520221 |
7 | 60223530600665533 |
oct | 5554737344525025 |
9 | 870612346552004 |
10 | 201000100211221 |
11 | 59054733564433 |
12 | 1a6631baa59071 |
13 | 88202c72433ac |
14 | 378c6574b5153 |
15 | 18387194ecb81 |
hex | b6cefb92aa15 |
201000100211221 has 4 divisors (see below), whose sum is σ = 201305107951200. Its totient is φ = 200695092471244.
The previous prime is 201000100211143. The next prime is 201000100211227. The reversal of 201000100211221 is 122112001000102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201000100211221 - 233 = 200991510276629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000100211227) 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, 152503869001 + ... + 152503870318.
It is an arithmetic number, because the mean of its divisors is an integer number (50326276987800).
Almost surely, 2201000100211221 is an apocalyptic number.
It is an amenable number.
201000100211221 is a deficient number, since it is larger than the sum of its proper divisors (305007739979).
201000100211221 is an equidigital number, since it uses as much as digits as its factorization.
201000100211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305007739978.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201000100211221 its reverse (122112001000102), we get a palindrome (323112101211323).
The spelling of 201000100211221 in words is "two hundred one trillion, one hundred million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •