Base | Representation |
---|---|
bin | 110100010000101111… |
… | …1011001110100000111 |
3 | 101201200120111001012200 |
4 | 1220201133121310013 |
5 | 3314322120430043 |
6 | 123320324245543 |
7 | 11052122005110 |
oct | 1504137316407 |
9 | 351616431180 |
10 | 112231030023 |
11 | 43662543a82 |
12 | 19901b408b3 |
13 | a7777a4308 |
14 | 560961b207 |
15 | 2dbcde37d3 |
hex | 1a217d9d07 |
112231030023 has 96 divisors (see below), whose sum is σ = 203721523200. Its totient is φ = 58051971648.
The previous prime is 112231030013. The next prime is 112231030031. The reversal of 112231030023 is 320030132211.
112231030023 is a `hidden beast` number, since 11 + 22 + 310 + 300 + 23 = 666.
It is not a de Polignac number, because 112231030023 - 24 = 112231030007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112231029978 and 112231030005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112231030003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 35981458 + ... + 35984576.
It is an arithmetic number, because the mean of its divisors is an integer number (2122099200).
Almost surely, 2112231030023 is an apocalyptic number.
112231030023 is a deficient number, since it is larger than the sum of its proper divisors (91490493177).
112231030023 is a wasteful number, since it uses less digits than its factorization.
112231030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4481 (or 4478 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 112231030023 its reverse (320030132211), we get a palindrome (432261162234).
The spelling of 112231030023 in words is "one hundred twelve billion, two hundred thirty-one million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •