Base | Representation |
---|---|
bin | 110100001011010110… |
… | …0111100011000110011 |
3 | 101201012221220022000222 |
4 | 1220112230330120303 |
5 | 3313434301431011 |
6 | 123250341003255 |
7 | 11044463353454 |
oct | 1502654743063 |
9 | 351187808028 |
10 | 112050030131 |
11 | 4357a359096 |
12 | 198713b352b |
13 | a7491402a0 |
14 | 55cd58312b |
15 | 2dac08dddb |
hex | 1a16b3c633 |
112050030131 has 32 divisors (see below), whose sum is σ = 133057064448. Its totient is φ = 93372088320.
The previous prime is 112050030121. The next prime is 112050030137. The reversal of 112050030131 is 131030050211.
It is a cyclic number.
It is not a de Polignac number, because 112050030131 - 230 = 110976288307 is a prime.
It is a super-2 number, since 2×1120500301312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (112050030137) 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 31 ways as a sum of consecutive naturals, for example, 701795 + ... + 846531.
It is an arithmetic number, because the mean of its divisors is an integer number (4158033264).
Almost surely, 2112050030131 is an apocalyptic number.
112050030131 is a deficient number, since it is larger than the sum of its proper divisors (21007034317).
112050030131 is a wasteful number, since it uses less digits than its factorization.
112050030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144911.
The product of its (nonzero) digits is 90, while the sum is 17.
Adding to 112050030131 its reverse (131030050211), we get a palindrome (243080080342).
The spelling of 112050030131 in words is "one hundred twelve billion, fifty million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •