Base | Representation |
---|---|
bin | 110100010001100000… |
… | …0011011011000101111 |
3 | 101201202100100020122210 |
4 | 1220203000123120233 |
5 | 3314400123330211 |
6 | 123323033341503 |
7 | 11052551126646 |
oct | 1504300333057 |
9 | 351670306583 |
10 | 112256464431 |
11 | 43675936251 |
12 | 1990a567893 |
13 | a77cb3b167 |
14 | 560cb5c35d |
15 | 2dc02699a6 |
hex | 1a2301b62f |
112256464431 has 8 divisors (see below), whose sum is σ = 149692006144. Its totient is φ = 74829282840.
The previous prime is 112256464423. The next prime is 112256464477. The reversal of 112256464431 is 134464652211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112256464431 - 23 = 112256464423 is a prime.
It is a super-2 number, since 2×1122564644312 (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 112256464431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112256466431) 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 7 ways as a sum of consecutive naturals, for example, 2058631 + ... + 2112456.
It is an arithmetic number, because the mean of its divisors is an integer number (18711500768).
Almost surely, 2112256464431 is an apocalyptic number.
112256464431 is a deficient number, since it is larger than the sum of its proper divisors (37435541713).
112256464431 is an equidigital number, since it uses as much as digits as its factorization.
112256464431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4180061.
The product of its digits is 138240, while the sum is 39.
The spelling of 112256464431 in words is "one hundred twelve billion, two hundred fifty-six million, four hundred sixty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •