Base | Representation |
---|---|
bin | 1100011001111100010… |
… | …0010101101011001001 |
3 | 202101002211212001102000 |
4 | 3012133010111223021 |
5 | 11442433230042301 |
6 | 241523522301213 |
7 | 21253236030615 |
oct | 3063704255311 |
9 | 671084761360 |
10 | 213122112201 |
11 | 82425970329 |
12 | 3537a1b7809 |
13 | 17135aa72cb |
14 | a45ab56345 |
15 | 5825497786 |
hex | 319f115ac9 |
213122112201 has 16 divisors (see below), whose sum is σ = 317339193600. Its totient is φ = 141360179184.
The previous prime is 213122112199. The next prime is 213122112211. The reversal of 213122112201 is 102211221312.
213122112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213122112201 - 21 = 213122112199 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (213122112211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20028721 + ... + 20039358.
It is an arithmetic number, because the mean of its divisors is an integer number (19833699600).
Almost surely, 2213122112201 is an apocalyptic number.
It is an amenable number.
213122112201 is a deficient number, since it is larger than the sum of its proper divisors (104217081399).
213122112201 is a wasteful number, since it uses less digits than its factorization.
213122112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40068285 (or 40068279 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 213122112201 its reverse (102211221312), we get a palindrome (315333333513).
The spelling of 213122112201 in words is "two hundred thirteen billion, one hundred twenty-two million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •