Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100011111111010000111101 |
3 | 222100201110120201220011021121 |
4 | 231231012012203333100331 |
5 | 202321331033113014323 |
6 | 1551303104431430541 |
7 | 60224365340452054 |
oct | 5555060643772075 |
9 | 870643521804247 |
10 | 201011022001213 |
11 | 59059328633956 |
12 | 1a665348685451 |
13 | 8821347bb6318 |
14 | 378cdb1c2739b |
15 | 1838b5828da5d |
hex | b6d1868ff43d |
201011022001213 has 2 divisors, whose sum is σ = 201011022001214. Its totient is φ = 201011022001212.
The previous prime is 201011022001211. The next prime is 201011022001247. The reversal of 201011022001213 is 312100220110102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139388176600729 + 61622845400484 = 11806277^2 + 7850022^2 .
It is a cyclic number.
It is not a de Polignac number, because 201011022001213 - 21 = 201011022001211 is a prime.
Together with 201011022001211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201011022001211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505511000606 + 100505511000607.
It is an arithmetic number, because the mean of its divisors is an integer number (100505511000607).
Almost surely, 2201011022001213 is an apocalyptic number.
It is an amenable number.
201011022001213 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011022001213 is an equidigital number, since it uses as much as digits as its factorization.
201011022001213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 201011022001213 its reverse (312100220110102), we get a palindrome (513111242111315).
The spelling of 201011022001213 in words is "two hundred one trillion, eleven billion, twenty-two million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •