Base | Representation |
---|---|
bin | 10000011001011110110… |
… | …011110100010101000001 |
3 | 10222201122122121112122121 |
4 | 100121132303310111001 |
5 | 121430313222323122 |
6 | 2221402231204241 |
7 | 144261640404160 |
oct | 20313663642501 |
9 | 3881578545577 |
10 | 1126872073537 |
11 | 3a49a39a9631 |
12 | 16248b216681 |
13 | 823571180c2 |
14 | 3c7803293d7 |
15 | 1e4a4bb6bc7 |
hex | 1065ecf4541 |
1126872073537 has 8 divisors (see below), whose sum is σ = 1363609904256. Its totient is φ = 909073269312.
The previous prime is 1126872073451. The next prime is 1126872073553. The reversal of 1126872073537 is 7353702786211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1126872073537 - 27 = 1126872073409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1126872073637) 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 7 ways as a sum of consecutive naturals, for example, 4734756493 + ... + 4734756730.
It is an arithmetic number, because the mean of its divisors is an integer number (170451238032).
Almost surely, 21126872073537 is an apocalyptic number.
1126872073537 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1126872073537 is a deficient number, since it is larger than the sum of its proper divisors (236737830719).
1126872073537 is an equidigital number, since it uses as much as digits as its factorization.
1126872073537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9469513247.
The product of its (nonzero) digits is 2963520, while the sum is 52.
The spelling of 1126872073537 in words is "one trillion, one hundred twenty-six billion, eight hundred seventy-two million, seventy-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •