Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100011111111100000100100 |
3 | 222100201110120201220012122121 |
4 | 231231012012203333200210 |
5 | 202321331033113032322 |
6 | 1551303104431435324 |
7 | 60224365340455012 |
oct | 5555060643774044 |
9 | 870643521805577 |
10 | 201011022002212 |
11 | 59059328634684 |
12 | 1a665348685b44 |
13 | 8821347bb6906 |
14 | 378cdb1c278b2 |
15 | 1838b5828dec7 |
hex | b6d1868ff824 |
201011022002212 has 48 divisors (see below), whose sum is σ = 381191695581312. Its totient is φ = 92377042168320.
The previous prime is 201011022002207. The next prime is 201011022002213. The reversal of 201011022002212 is 212200220110102.
It is a happy number.
201011022002212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2010110220022122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201011022002213) 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, 10200238 + ... + 22495930.
It is an arithmetic number, because the mean of its divisors is an integer number (7941493657944).
Almost surely, 2201011022002212 is an apocalyptic number.
It is an amenable number.
201011022002212 is a deficient number, since it is larger than the sum of its proper divisors (180180673579100).
201011022002212 is a wasteful number, since it uses less digits than its factorization.
201011022002212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12301348 (or 12301346 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201011022002212 its reverse (212200220110102), we get a palindrome (413211242112314).
The spelling of 201011022002212 in words is "two hundred one trillion, eleven billion, twenty-two million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •