Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …001010011110000100100 |
3 | 21010021000011012222221012 |
4 | 131100333001103300210 |
5 | 230422214103032322 |
6 | 4135515411241352 |
7 | 265203660652322 |
oct | 35207701236044 |
9 | 7107004188835 |
10 | 2011102002212 |
11 | 7059a3718426 |
12 | 285921ba9258 |
13 | 117852653954 |
14 | 6d4a3112d12 |
15 | 374a79b9ae2 |
hex | 1d43f053c24 |
2011102002212 has 24 divisors (see below), whose sum is σ = 3560844540792. Its totient is φ = 993754656000.
The previous prime is 2011102002191. The next prime is 2011102002229. The reversal of 2011102002212 is 2122002011102.
It can be written as a sum of positive squares in 4 ways, for example, as 190048914916 + 1821053087296 = 435946^2 + 1349464^2 .
It is a super-2 number, since 2×20111020022122 (a number of 25 digits) contains 22 as substring.
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, 4382153 + ... + 4819280.
It is an arithmetic number, because the mean of its divisors is an integer number (148368522533).
Almost surely, 22011102002212 is an apocalyptic number.
It is an amenable number.
2011102002212 is a deficient number, since it is larger than the sum of its proper divisors (1549742538580).
2011102002212 is a wasteful number, since it uses less digits than its factorization.
2011102002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9202079 (or 9202077 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2011102002212 its reverse (2122002011102), we get a palindrome (4133104013314).
The spelling of 2011102002212 in words is "two trillion, eleven billion, one hundred two million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •