Base | Representation |
---|---|
bin | 1001001001010001111110… |
… | …10111100001110010101010 |
3 | 2122012111200110001121222110 |
4 | 10210220333113201302222 |
5 | 10113440441100342302 |
6 | 110434241415303150 |
7 | 4143623011465044 |
oct | 444507727416252 |
9 | 78174613047873 |
10 | 20110100012202 |
11 | 6453711207862 |
12 | 230957b97aab6 |
13 | b2b4b3429b55 |
14 | 4d7496836a94 |
15 | 24d19ab36b6c |
hex | 124a3f5e1caa |
20110100012202 has 32 divisors (see below), whose sum is σ = 41307535962432. Its totient is φ = 6522146676864.
The previous prime is 20110100012173. The next prime is 20110100012203. The reversal of 20110100012202 is 20221000101102.
It is a super-3 number, since 3×201101000122023 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (20110100012203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42118653 + ... + 42593439.
It is an arithmetic number, because the mean of its divisors is an integer number (1290860498826).
Almost surely, 220110100012202 is an apocalyptic number.
20110100012202 is an abundant number, since it is smaller than the sum of its proper divisors (21197435950230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110100012202 is a wasteful number, since it uses less digits than its factorization.
20110100012202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665622.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20110100012202 its reverse (20221000101102), we get a palindrome (40331100113304).
The spelling of 20110100012202 in words is "twenty trillion, one hundred ten billion, one hundred million, twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •