Base | Representation |
---|---|
bin | 11001011111011100011100… |
… | …100010000010000101111010 |
3 | 112200221210200201222202012011 |
4 | 121133130130202002011322 |
5 | 104143320344030323002 |
6 | 1034235314004040134 |
7 | 32420553056433511 |
oct | 3137343442020572 |
9 | 480853621882164 |
10 | 112112010011002 |
11 | 327a4488996101 |
12 | 106a808539304a |
13 | 4a7316a5a3641 |
14 | 1d98370917678 |
15 | ce6455ec68d7 |
hex | 65f71c88217a |
112112010011002 has 8 divisors (see below), whose sum is σ = 168169184312436. Its totient is φ = 56055615240192.
The previous prime is 112112010010993. The next prime is 112112010011009. The reversal of 112112010011002 is 200110010211211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 66818019744441 + 45293990266561 = 8174229^2 + 6730081^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1121120100110022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112112010011009) 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 3 ways as a sum of consecutive naturals, for example, 194522973 + ... + 195098464.
Almost surely, 2112112010011002 is an apocalyptic number.
112112010011002 is a deficient number, since it is larger than the sum of its proper divisors (56057174301434).
112112010011002 is a wasteful number, since it uses less digits than its factorization.
112112010011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389765312.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112112010011002 its reverse (200110010211211), we get a palindrome (312222020222213).
The spelling of 112112010011002 in words is "one hundred twelve trillion, one hundred twelve billion, ten million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •