Base | Representation |
---|---|
bin | 110100001110010101… |
… | …1111010111011110011 |
3 | 101201110221210220100201 |
4 | 1220130223322323303 |
5 | 3314141002102311 |
6 | 123304324500031 |
7 | 11050122613030 |
oct | 1503453727363 |
9 | 351427726321 |
10 | 112150425331 |
11 | 43620a9a52a |
12 | 1989ab4a617 |
13 | a763b91929 |
14 | 55dca38387 |
15 | 2db5cc09c1 |
hex | 1a1cafaef3 |
112150425331 has 32 divisors (see below), whose sum is σ = 136871907840. Its totient is φ = 89703661056.
The previous prime is 112150425329. The next prime is 112150425341. The reversal of 112150425331 is 133524051211.
It is a cyclic number.
It is not a de Polignac number, because 112150425331 - 21 = 112150425329 is a prime.
It is a super-2 number, since 2×1121504253312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112150425331.
It is not an unprimeable number, because it can be changed into a prime (112150425341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7383861 + ... + 7399033.
It is an arithmetic number, because the mean of its divisors is an integer number (4277247120).
Almost surely, 2112150425331 is an apocalyptic number.
112150425331 is a deficient number, since it is larger than the sum of its proper divisors (24721482509).
112150425331 is a wasteful number, since it uses less digits than its factorization.
112150425331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15723.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 112150425331 its reverse (133524051211), we get a palindrome (245674476542).
The spelling of 112150425331 in words is "one hundred twelve billion, one hundred fifty million, four hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •