Base | Representation |
---|---|
bin | 110100010000000111… |
… | …1111110110011010010 |
3 | 101201122010022021111210 |
4 | 1220200033332303102 |
5 | 3314301303210002 |
6 | 123314302120550 |
7 | 11051450022252 |
oct | 1504017766322 |
9 | 351563267453 |
10 | 112210210002 |
11 | 43651813650 |
12 | 198b6b80156 |
13 | a773394887 |
14 | 560695b962 |
15 | 2dbb17e96c |
hex | 1a203fecd2 |
112210210002 has 16 divisors (see below), whose sum is σ = 244822276512. Its totient is φ = 34003093920.
The previous prime is 112210210001. The next prime is 112210210103. The reversal of 112210210002 is 200012012211.
It is a super-3 number, since 3×1122102100023 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 112210210002.
It is not an unprimeable number, because it can be changed into a prime (112210210001) by changing a digit.
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, 850077283 + ... + 850077414.
It is an arithmetic number, because the mean of its divisors is an integer number (15301392282).
Almost surely, 2112210210002 is an apocalyptic number.
112210210002 is an abundant number, since it is smaller than the sum of its proper divisors (132612066510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112210210002 is a wasteful number, since it uses less digits than its factorization.
112210210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700154713.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 112210210002 its reverse (200012012211), we get a palindrome (312222222213).
The spelling of 112210210002 in words is "one hundred twelve billion, two hundred ten million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •