Base | Representation |
---|---|
bin | 110100010110100010… |
… | …1000010001101101011 |
3 | 101202012010022022022212 |
4 | 1220231011002031223 |
5 | 3320221403203303 |
6 | 123351511235335 |
7 | 11060002336232 |
oct | 1505505021553 |
9 | 352163268285 |
10 | 112425444203 |
11 | 43752261256 |
12 | 19957078b4b |
13 | a7a8b53ca7 |
14 | 5627387b19 |
15 | 2dceee7ad8 |
hex | 1a2d14236b |
112425444203 has 4 divisors (see below), whose sum is σ = 115463969760. Its totient is φ = 109386918648.
The previous prime is 112425444151. The next prime is 112425444211. The reversal of 112425444203 is 302444524211.
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 112425444203 - 218 = 112425182059 is a prime.
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 112425444203.
It is not an unprimeable number, because it can be changed into a prime (112425444283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1519262723 + ... + 1519262796.
It is an arithmetic number, because the mean of its divisors is an integer number (28865992440).
Almost surely, 2112425444203 is an apocalyptic number.
112425444203 is a deficient number, since it is larger than the sum of its proper divisors (3038525557).
112425444203 is an equidigital number, since it uses as much as digits as its factorization.
112425444203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3038525556.
The product of its (nonzero) digits is 30720, while the sum is 32.
Adding to 112425444203 its reverse (302444524211), we get a palindrome (414869968414).
The spelling of 112425444203 in words is "one hundred twelve billion, four hundred twenty-five million, four hundred forty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •