Base | Representation |
---|---|
bin | 11001100100010000101111… |
… | …100001000110000111000011 |
3 | 112202010110010212020001211102 |
4 | 121210100233201012013003 |
5 | 104214231321444423321 |
6 | 1035051341523205015 |
7 | 32453512243513235 |
oct | 3144205741060703 |
9 | 482113125201742 |
10 | 112443041014211 |
11 | 3291190a2a53a6 |
12 | 1074026ab1676b |
13 | 4a9844426acbb |
14 | 1daa3b4da2255 |
15 | ceed7ca66c0b |
hex | 66442f8461c3 |
112443041014211 has 8 divisors (see below), whose sum is σ = 112602042734784. Its totient is φ = 112284146768040.
The previous prime is 112443041014193. The next prime is 112443041014231. The reversal of 112443041014211 is 112410140344211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112443041014211 - 230 = 112441967272387 is a prime.
It is a super-2 number, since 2×1124430410142112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112443041014231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24774545 + ... + 28959698.
It is an arithmetic number, because the mean of its divisors is an integer number (14075255341848).
Almost surely, 2112443041014211 is an apocalyptic number.
112443041014211 is a deficient number, since it is larger than the sum of its proper divisors (159001720573).
112443041014211 is a wasteful number, since it uses less digits than its factorization.
112443041014211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53737201.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 112443041014211 its reverse (112410140344211), we get a palindrome (224853181358422).
The spelling of 112443041014211 in words is "one hundred twelve trillion, four hundred forty-three billion, forty-one million, fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •