Base | Representation |
---|---|
bin | 100000000001111100011… |
… | …100100100100110111000 |
3 | 21210102110012220021222122 |
4 | 200001330130210212320 |
5 | 242030333421322222 |
6 | 4403102042140412 |
7 | 315011404551626 |
oct | 40017434444670 |
9 | 7712405807878 |
10 | 2201111120312 |
11 | 779538932135 |
12 | 2b670b7b1708 |
13 | 12c743b28990 |
14 | 7876a366516 |
15 | 3c3c8c82a42 |
hex | 2007c7249b8 |
2201111120312 has 32 divisors (see below), whose sum is σ = 4539116232000. Its totient is φ = 994282598784.
The previous prime is 2201111120279. The next prime is 2201111120353. The reversal of 2201111120312 is 2130211111022.
It is a happy number.
It is a super-3 number, since 3×22011111203123 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225149687 + ... + 225159462.
It is an arithmetic number, because the mean of its divisors is an integer number (141847382250).
Almost surely, 22201111120312 is an apocalyptic number.
It is an amenable number.
2201111120312 is an abundant number, since it is smaller than the sum of its proper divisors (2338005111688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201111120312 is a wasteful number, since it uses less digits than its factorization.
2201111120312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450309215 (or 450309211 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 2201111120312 its reverse (2130211111022), we get a palindrome (4331322231334).
The spelling of 2201111120312 in words is "two trillion, two hundred one billion, one hundred eleven million, one hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •