Base | Representation |
---|---|
bin | 11001100010010110111010… |
… | …101101110101010010000010 |
3 | 112201122221111120201222001012 |
4 | 121202112322231311102002 |
5 | 104210110422443300002 |
6 | 1034511305520440522 |
7 | 32441201550604115 |
oct | 3142267255652202 |
9 | 481587446658035 |
10 | 112312232400002 |
11 | 32871394241468 |
12 | 1071aa43479142 |
13 | 4a88cc89b872b |
14 | 1da3d2636857c |
15 | ceb773c28d52 |
hex | 6625bab75482 |
112312232400002 has 4 divisors (see below), whose sum is σ = 168468348600006. Its totient is φ = 56156116200000.
The previous prime is 112312232399953. The next prime is 112312232400007. The reversal of 112312232400002 is 200004232213211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 102003515903041 + 10308716496961 = 10099679^2 + 3210719^2 .
It is a super-2 number, since 2×1123122324000022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112312232400007) 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 as a sum of consecutive naturals, namely, 28078058099999 + ... + 28078058100002.
Almost surely, 2112312232400002 is an apocalyptic number.
112312232400002 is a deficient number, since it is larger than the sum of its proper divisors (56156116200004).
112312232400002 is an equidigital number, since it uses as much as digits as its factorization.
112312232400002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56156116200003.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 112312232400002 its reverse (200004232213211), we get a palindrome (312316464613213).
The spelling of 112312232400002 in words is "one hundred twelve trillion, three hundred twelve billion, two hundred thirty-two million, four hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •