Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0100100110000111100 |
3 | 201012211210212222001012 |
4 | 2323031030210300330 |
5 | 11243132321334322 |
6 | 232202045534352 |
7 | 20344146224156 |
oct | 2731514446074 |
9 | 635753788035 |
10 | 201011121212 |
11 | 782805a0570 |
12 | 32b5a2743b8 |
13 | 15c55951355 |
14 | 9a2c4c5ad6 |
15 | 5367100ae2 |
hex | 2ecd324c3c |
201011121212 has 24 divisors (see below), whose sum is σ = 384835640112. Its totient is φ = 91109849600.
The previous prime is 201011121173. The next prime is 201011121247. The reversal of 201011121212 is 212121110102.
201011121212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 6455339 + ... + 6486402.
It is an arithmetic number, because the mean of its divisors is an integer number (16034818338).
Almost surely, 2201011121212 is an apocalyptic number.
201011121212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201011121212 is a deficient number, since it is larger than the sum of its proper divisors (183824518900).
201011121212 is a wasteful number, since it uses less digits than its factorization.
201011121212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12942109 (or 12942107 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201011121212 its reverse (212121110102), we get a palindrome (413132231314).
It can be divided in two parts, 201011 and 121212, that added together give a palindrome (322223).
The spelling of 201011121212 in words is "two hundred one billion, eleven million, one hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •