Base | Representation |
---|---|
bin | 110100001010100011… |
… | …0011000101001000111 |
3 | 101201011002022101121112 |
4 | 1220111012120221013 |
5 | 3313410411120111 |
6 | 123243540435235 |
7 | 11044016010320 |
oct | 1502506305107 |
9 | 351132271545 |
10 | 112023145031 |
11 | 435661659a6 |
12 | 198643a8b1b |
13 | a7436b9045 |
14 | 55c9b85447 |
15 | 2da9a2ce8b |
hex | 1a15198a47 |
112023145031 has 4 divisors (see below), whose sum is σ = 128026451472. Its totient is φ = 96019838592.
The previous prime is 112023144977. The next prime is 112023145049. The reversal of 112023145031 is 130541320211.
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 112023145031 - 26 = 112023144967 is a prime.
It is a super-2 number, since 2×1120231450312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112023144988 and 112023145006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112023145051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8001653210 + ... + 8001653223.
It is an arithmetic number, because the mean of its divisors is an integer number (32006612868).
Almost surely, 2112023145031 is an apocalyptic number.
112023145031 is a deficient number, since it is larger than the sum of its proper divisors (16003306441).
112023145031 is an equidigital number, since it uses as much as digits as its factorization.
112023145031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16003306440.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 112023145031 its reverse (130541320211), we get a palindrome (242564465242).
The spelling of 112023145031 in words is "one hundred twelve billion, twenty-three million, one hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •