Base | Representation |
---|---|
bin | 110010001000111111… |
… | …1100101010100100011 |
3 | 101021221010111202010202 |
4 | 1210101333211110203 |
5 | 3231010033004021 |
6 | 121244331415415 |
7 | 10531212301646 |
oct | 1442177452443 |
9 | 337833452122 |
10 | 107676063011 |
11 | 4173536a930 |
12 | 18a505b456b |
13 | a1ccbc366a |
14 | 52d66c3a5d |
15 | 2c03098a0b |
hex | 1911fe5523 |
107676063011 has 32 divisors (see below), whose sum is σ = 123420672000. Its totient is φ = 92984768800.
The previous prime is 107676062993. The next prime is 107676063101. The reversal of 107676063011 is 110360676701.
It is not a de Polignac number, because 107676063011 - 26 = 107676062947 is a prime.
It is a super-2 number, since 2×1076760630112 (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 (107676063311) 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 31 ways as a sum of consecutive naturals, for example, 35902490 + ... + 35905488.
It is an arithmetic number, because the mean of its divisors is an integer number (3856896000).
Almost surely, 2107676063011 is an apocalyptic number.
107676063011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
107676063011 is a deficient number, since it is larger than the sum of its proper divisors (15744608989).
107676063011 is a wasteful number, since it uses less digits than its factorization.
107676063011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3967.
The product of its (nonzero) digits is 31752, while the sum is 38.
The spelling of 107676063011 in words is "one hundred seven billion, six hundred seventy-six million, sixty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •