Base | Representation |
---|---|
bin | 110100011010101110… |
… | …1110101001011101001 |
3 | 101202112221002112001210 |
4 | 1220311131311023221 |
5 | 3321013414142103 |
6 | 123413455303333 |
7 | 11063331406524 |
oct | 1506535651351 |
9 | 352487075053 |
10 | 112566162153 |
11 | 43814733785 |
12 | 1999621ab49 |
13 | a7cc053053 |
14 | 563bd37bbb |
15 | 2ddc541e03 |
hex | 1a357752e9 |
112566162153 has 4 divisors (see below), whose sum is σ = 150088216208. Its totient is φ = 75044108100.
The previous prime is 112566162083. The next prime is 112566162161. The reversal of 112566162153 is 351261665211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 351261665211 = 3 ⋅117087221737.
It is not a de Polignac number, because 112566162153 - 212 = 112566158057 is a prime.
It is a super-2 number, since 2×1125661621532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112566162193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18761027023 + ... + 18761027028.
It is an arithmetic number, because the mean of its divisors is an integer number (37522054052).
Almost surely, 2112566162153 is an apocalyptic number.
It is an amenable number.
112566162153 is a deficient number, since it is larger than the sum of its proper divisors (37522054055).
112566162153 is an equidigital number, since it uses as much as digits as its factorization.
112566162153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37522054054.
The product of its digits is 64800, while the sum is 39.
The spelling of 112566162153 in words is "one hundred twelve billion, five hundred sixty-six million, one hundred sixty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •