Base | Representation |
---|---|
bin | 11001100010011111000111… |
… | …110100001101111000000010 |
3 | 112201200210020112202200222211 |
4 | 121202133013310031320002 |
5 | 104210231443240041002 |
6 | 1034515324023252334 |
7 | 32441633063120503 |
oct | 3142370764157002 |
9 | 481623215680884 |
10 | 112321042112002 |
11 | 328750a5083489 |
12 | 107206a18aa0aa |
13 | 4a89aa0c02179 |
14 | 1da45203a8baa |
15 | cebadc368dd7 |
hex | 6627c7d0de02 |
112321042112002 has 8 divisors (see below), whose sum is σ = 168481611157500. Its totient is φ = 56160505059504.
The previous prime is 112321042111903. The next prime is 112321042112003. The reversal of 112321042112002 is 200211240123211.
It can be written as a sum of positive squares in 2 ways, for example, as 109140665655681 + 3180376456321 = 10447041^2 + 1783361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1123210421120022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112321042112003) 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, 5010124 + ... + 15803272.
Almost surely, 2112321042112002 is an apocalyptic number.
112321042112002 is a deficient number, since it is larger than the sum of its proper divisors (56160569045498).
112321042112002 is a wasteful number, since it uses less digits than its factorization.
112321042112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15996500.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 112321042112002 its reverse (200211240123211), we get a palindrome (312532282235213).
The spelling of 112321042112002 in words is "one hundred twelve trillion, three hundred twenty-one billion, forty-two million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •