Base | Representation |
---|---|
bin | 11001011110010001000111… |
… | …010011010101100011101001 |
3 | 112200200001220121012000111220 |
4 | 121132101013103111203221 |
5 | 104141004220014401413 |
6 | 1034134215411012253 |
7 | 32411660446044666 |
oct | 3136210723254351 |
9 | 480601817160456 |
10 | 112031123200233 |
11 | 32773150445a66 |
12 | 1069447059a089 |
13 | 4a68649812533 |
14 | 1d9449a096a6d |
15 | ce42bec34223 |
hex | 65e4474d58e9 |
112031123200233 has 8 divisors (see below), whose sum is σ = 149377025087808. Its totient is φ = 74686318389744.
The previous prime is 112031123200231. The next prime is 112031123200289. The reversal of 112031123200233 is 332002321130211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112031123200233 - 21 = 112031123200231 is a prime.
It is a super-2 number, since 2×1120311232002332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112031123200231) 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, 274030966 + ... + 274439487.
It is an arithmetic number, because the mean of its divisors is an integer number (18672128135976).
Almost surely, 2112031123200233 is an apocalyptic number.
It is an amenable number.
112031123200233 is a deficient number, since it is larger than the sum of its proper divisors (37345901887575).
112031123200233 is an equidigital number, since it uses as much as digits as its factorization.
112031123200233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 548538543.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 112031123200233 its reverse (332002321130211), we get a palindrome (444033444330444).
The spelling of 112031123200233 in words is "one hundred twelve trillion, thirty-one billion, one hundred twenty-three million, two hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •