Base | Representation |
---|---|
bin | 11001100010001100011110… |
… | …100111111010001101100001 |
3 | 112201121212120102112100000101 |
4 | 121202030132213322031201 |
5 | 104204414444024321131 |
6 | 1034502213354422401 |
7 | 32440324025132266 |
oct | 3142143647721541 |
9 | 481555512470011 |
10 | 112301023667041 |
11 | 328676621a64a0 |
12 | 10718835731a01 |
13 | 4a87c30769b71 |
14 | 1da358188126d |
15 | ceb319ba7c61 |
hex | 66231e9fa361 |
112301023667041 has 16 divisors (see below), whose sum is σ = 125407666188288. Its totient is φ = 99679123630800.
The previous prime is 112301023667011. The next prime is 112301023667059. The reversal of 112301023667041 is 140766320103211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112301023667041 - 217 = 112301023535969 is a prime.
It is a super-2 number, since 2×1123010236670412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112301023667011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44591301 + ... + 47042386.
It is an arithmetic number, because the mean of its divisors is an integer number (7837979136768).
Almost surely, 2112301023667041 is an apocalyptic number.
112301023667041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112301023667041 is a deficient number, since it is larger than the sum of its proper divisors (13106642521247).
112301023667041 is a wasteful number, since it uses less digits than its factorization.
112301023667041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91636332.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 112301023667041 in words is "one hundred twelve trillion, three hundred one billion, twenty-three million, six hundred sixty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •