Base | Representation |
---|---|
bin | 11001100010001100110000… |
… | …011110100010011001000111 |
3 | 112201121220100022011012002022 |
4 | 121202030300132202121013 |
5 | 104204421102214400241 |
6 | 1034502303214433355 |
7 | 32440334323125365 |
oct | 3142146036423107 |
9 | 481556308135068 |
10 | 112301323200071 |
11 | 328677a6291055 |
12 | 107188b9b0285b |
13 | 4a87c7a833245 |
14 | 1da35ad572635 |
15 | ceb33612354b |
hex | 6623307a2647 |
112301323200071 has 2 divisors, whose sum is σ = 112301323200072. Its totient is φ = 112301323200070.
The previous prime is 112301323199957. The next prime is 112301323200089. The reversal of 112301323200071 is 170002323103211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112301323200071 - 210 = 112301323199047 is a prime.
It is a super-2 number, since 2×1123013232000712 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112301323200071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112301323250071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56150661600035 + 56150661600036.
It is an arithmetic number, because the mean of its divisors is an integer number (56150661600036).
Almost surely, 2112301323200071 is an apocalyptic number.
112301323200071 is a deficient number, since it is larger than the sum of its proper divisors (1).
112301323200071 is an equidigital number, since it uses as much as digits as its factorization.
112301323200071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 112301323200071 its reverse (170002323103211), we get a palindrome (282303646303282).
The spelling of 112301323200071 in words is "one hundred twelve trillion, three hundred one billion, three hundred twenty-three million, two hundred thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •