Base | Representation |
---|---|
bin | 11001011110000110110000… |
… | …010111100000111011111100 |
3 | 112200122000012110210202201211 |
4 | 121132012300113200323330 |
5 | 104140313430224014322 |
6 | 1034125140015414204 |
7 | 32411115023651533 |
oct | 3136066027407374 |
9 | 480560173722654 |
10 | 112020001001212 |
11 | 32769463234247 |
12 | 10692287824364 |
13 | 4a675964a1095 |
14 | 1d93b22c9731a |
15 | ce3d6d5a7b77 |
hex | 65e1b05e0efc |
112020001001212 has 12 divisors (see below), whose sum is σ = 196035263081280. Its totient is φ = 56009925835136.
The previous prime is 112020001001123. The next prime is 112020001001219. The reversal of 112020001001212 is 212100100020211.
112020001001212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 112020001001192 and 112020001001201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020001001219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15220012 + ... + 21346867.
It is an arithmetic number, because the mean of its divisors is an integer number (16336271923440).
Almost surely, 2112020001001212 is an apocalyptic number.
It is an amenable number.
112020001001212 is a deficient number, since it is larger than the sum of its proper divisors (84015262080068).
112020001001212 is a wasteful number, since it uses less digits than its factorization.
112020001001212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37332740 (or 37332738 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112020001001212 its reverse (212100100020211), we get a palindrome (324120101021423).
The spelling of 112020001001212 in words is "one hundred twelve trillion, twenty billion, one million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •