Base | Representation |
---|---|
bin | 11001011111101110010101… |
… | …100011011110110010101111 |
3 | 112201000122021112112200202020 |
4 | 121133232111203132302233 |
5 | 104144124214344144043 |
6 | 1034252212123201223 |
7 | 32422133112301005 |
oct | 3137562543366257 |
9 | 481018245480666 |
10 | 112131220303023 |
11 | 328016466738a9 |
12 | 106ab946976213 |
13 | 4a74c0c48cb3c |
14 | 1d99273d92a75 |
15 | ce6bcc74ee83 |
hex | 65fb958decaf |
112131220303023 has 8 divisors (see below), whose sum is σ = 149517071372208. Its totient is φ = 74749758051264.
The previous prime is 112131220303021. The next prime is 112131220303033. The reversal of 112131220303023 is 320303022131211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112131220303023 - 21 = 112131220303021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112131220302984 and 112131220303002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112131220303021) 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, 1097144740 + ... + 1097246937.
It is an arithmetic number, because the mean of its divisors is an integer number (18689633921526).
Almost surely, 2112131220303023 is an apocalyptic number.
112131220303023 is a deficient number, since it is larger than the sum of its proper divisors (37385851069185).
112131220303023 is a wasteful number, since it uses less digits than its factorization.
112131220303023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2194408713.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 112131220303023 its reverse (320303022131211), we get a palindrome (432434242434234).
The spelling of 112131220303023 in words is "one hundred twelve trillion, one hundred thirty-one billion, two hundred twenty million, three hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •