Base | Representation |
---|---|
bin | 10110010100011110… |
… | …01100101000101101 |
3 | 1010221002222012200221 |
4 | 23022033030220231 |
5 | 144020111304031 |
6 | 5301015251341 |
7 | 602643051400 |
oct | 131217145055 |
9 | 33832865627 |
10 | 11982916141 |
11 | 509a053289 |
12 | 23a5079b51 |
13 | 118c762831 |
14 | 819651d37 |
15 | 4a1ee8a11 |
hex | 2ca3cca2d |
11982916141 has 12 divisors (see below), whose sum is σ = 14009368800. Its totient is φ = 10219449240.
The previous prime is 11982916133. The next prime is 11982916151. The reversal of 11982916141 is 14161928911.
11982916141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11982916141 - 23 = 11982916133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11982916151) 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 11 ways as a sum of consecutive naturals, for example, 604695 + ... + 624196.
It is an arithmetic number, because the mean of its divisors is an integer number (1167447400).
Almost surely, 211982916141 is an apocalyptic number.
It is an amenable number.
11982916141 is a deficient number, since it is larger than the sum of its proper divisors (2026452659).
11982916141 is a wasteful number, since it uses less digits than its factorization.
11982916141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229104 (or 1229097 counting only the distinct ones).
The product of its digits is 31104, while the sum is 43.
The spelling of 11982916141 in words is "eleven billion, nine hundred eighty-two million, nine hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •