Base | Representation |
---|---|
bin | 110100011001110111… |
… | …1101111000101001001 |
3 | 101202110220210020110002 |
4 | 1220303233233011021 |
5 | 3320434022120241 |
6 | 123410544532345 |
7 | 11062531164254 |
oct | 1506357570511 |
9 | 352426706402 |
10 | 112537301321 |
11 | 437aa411155 |
12 | 199886210b5 |
13 | a7c6089733 |
14 | 563818409b |
15 | 2dd9c4089b |
hex | 1a33bef149 |
112537301321 has 4 divisors (see below), whose sum is σ = 118460317200. Its totient is φ = 106614285444.
The previous prime is 112537301309. The next prime is 112537301353. The reversal of 112537301321 is 123103735211.
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: 123103735211 = 338423 ⋅363757.
It is a cyclic number.
It is not a de Polignac number, because 112537301321 - 210 = 112537300297 is a prime.
It is a super-2 number, since 2×1125373013212 (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 (112537301221) 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, 2961507911 + ... + 2961507948.
It is an arithmetic number, because the mean of its divisors is an integer number (29615079300).
Almost surely, 2112537301321 is an apocalyptic number.
It is an amenable number.
112537301321 is a deficient number, since it is larger than the sum of its proper divisors (5923015879).
112537301321 is an equidigital number, since it uses as much as digits as its factorization.
112537301321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5923015878.
The product of its (nonzero) digits is 3780, while the sum is 29.
The spelling of 112537301321 in words is "one hundred twelve billion, five hundred thirty-seven million, three hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •