Base | Representation |
---|---|
bin | 110100010011000110… |
… | …1111010001010100111 |
3 | 101201220002200220100201 |
4 | 1220212031322022213 |
5 | 3320002421030043 |
6 | 123332240051331 |
7 | 11054104024333 |
oct | 1504615721247 |
9 | 351802626321 |
10 | 112310330023 |
11 | 436a3287271 |
12 | 19924603b47 |
13 | a78b04aba8 |
14 | 5615d807c3 |
15 | 2dc4d59c4d |
hex | 1a2637a2a7 |
112310330023 has 4 divisors (see below), whose sum is σ = 112649636488. Its totient is φ = 111971023560.
The previous prime is 112310329991. The next prime is 112310330053. The reversal of 112310330023 is 320033013211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112310330023 - 25 = 112310329991 is a prime.
It is a super-2 number, since 2×1123103300232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112310330053) 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 3 ways as a sum of consecutive naturals, for example, 169652736 + ... + 169653397.
It is an arithmetic number, because the mean of its divisors is an integer number (28162409122).
Almost surely, 2112310330023 is an apocalyptic number.
112310330023 is a deficient number, since it is larger than the sum of its proper divisors (339306465).
112310330023 is an equidigital number, since it uses as much as digits as its factorization.
112310330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339306464.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 112310330023 its reverse (320033013211), we get a palindrome (432343343234).
The spelling of 112310330023 in words is "one hundred twelve billion, three hundred ten million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •