Base | Representation |
---|---|
bin | 101101101101001110011110… |
… | …010010111100011111111011 |
3 | 222100202022210010121221222212 |
4 | 231231032132102330133323 |
5 | 202322002440042334321 |
6 | 1551311152350205335 |
7 | 60225134150303411 |
oct | 5555163622743773 |
9 | 870668703557885 |
10 | 201020010121211 |
11 | 590621201504a6 |
12 | 1a6670367b384b |
13 | 882214b067118 |
14 | 378d5c58292b1 |
15 | 1838ed23c055b |
hex | b6d39e4bc7fb |
201020010121211 has 8 divisors (see below), whose sum is σ = 203309128923600. Its totient is φ = 198735314738688.
The previous prime is 201020010121187. The next prime is 201020010121241. The reversal of 201020010121211 is 112121010020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201020010121211 - 246 = 130651265943547 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201020010121241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1105763561 + ... + 1105945338.
It is an arithmetic number, because the mean of its divisors is an integer number (25413641115450).
Almost surely, 2201020010121211 is an apocalyptic number.
201020010121211 is a deficient number, since it is larger than the sum of its proper divisors (2289118802389).
201020010121211 is an equidigital number, since it uses as much as digits as its factorization.
201020010121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2211709933.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201020010121211 its reverse (112121010020102), we get a palindrome (313141020141313).
The spelling of 201020010121211 in words is "two hundred one trillion, twenty billion, ten million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •