Base | Representation |
---|---|
bin | 110100001010110000… |
… | …1000000010000010111 |
3 | 101201011120102220121222 |
4 | 1220111201000100113 |
5 | 3313414202414111 |
6 | 123244350200555 |
7 | 11044132222331 |
oct | 1502541002027 |
9 | 351146386558 |
10 | 112030123031 |
11 | 4356a0a1642 |
12 | 198667b315b |
13 | a744c90238 |
14 | 55caa80451 |
15 | 2daa45a7db |
hex | 1a15840417 |
112030123031 has 8 divisors (see below), whose sum is σ = 115963937280. Its totient is φ = 108143991648.
The previous prime is 112030123027. The next prime is 112030123061. The reversal of 112030123031 is 130321030211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112030123031 - 22 = 112030123027 is a prime.
It is a super-2 number, since 2×1120301230312 (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 (112030123061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11915936 + ... + 11925333.
It is an arithmetic number, because the mean of its divisors is an integer number (14495492160).
Almost surely, 2112030123031 is an apocalyptic number.
112030123031 is a deficient number, since it is larger than the sum of its proper divisors (3933814249).
112030123031 is a wasteful number, since it uses less digits than its factorization.
112030123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23841433.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 112030123031 its reverse (130321030211), we get a palindrome (242351153242).
The spelling of 112030123031 in words is "one hundred twelve billion, thirty million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •