Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1010101001001011101 |
3 | 201020002010221011101220 |
4 | 2323102213111021131 |
5 | 11243324104134323 |
6 | 232215054123553 |
7 | 20346331655562 |
oct | 2732247251135 |
9 | 636063834356 |
10 | 201102021213 |
11 | 78317937035 |
12 | 32b847b05b9 |
13 | 15c6b729b32 |
14 | 9a3a5c8869 |
15 | 53700a90e3 |
hex | 2ed29d525d |
201102021213 has 16 divisors (see below), whose sum is σ = 274641185280. Its totient is φ = 130821559344.
The previous prime is 201102021193. The next prime is 201102021229. The reversal of 201102021213 is 312120201102.
It is not a de Polignac number, because 201102021213 - 212 = 201102017117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201102021192 and 201102021201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102021293) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 633481 + ... + 896382.
It is an arithmetic number, because the mean of its divisors is an integer number (17165074080).
Almost surely, 2201102021213 is an apocalyptic number.
It is an amenable number.
201102021213 is a deficient number, since it is larger than the sum of its proper divisors (73539164067).
201102021213 is a wasteful number, since it uses less digits than its factorization.
201102021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530928.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 201102021213 its reverse (312120201102), we get a palindrome (513222222315).
The spelling of 201102021213 in words is "two hundred one billion, one hundred two million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.623 sec. • engine limits •