Base | Representation |
---|---|
bin | 10101111100110010… |
… | …01001001000101101 |
3 | 1010102021001012210220 |
4 | 22332121021020231 |
5 | 143113223243103 |
6 | 5225200121553 |
7 | 565011006315 |
oct | 127631111055 |
9 | 33367035726 |
10 | 11784196653 |
11 | 4aa79653a9 |
12 | 234a6062b9 |
13 | 115a536338 |
14 | 7db0c4445 |
15 | 48e843c53 |
hex | 2be64922d |
11784196653 has 8 divisors (see below), whose sum is σ = 15859106208. Its totient is φ = 7782709104.
The previous prime is 11784196651. The next prime is 11784196729. The reversal of 11784196653 is 35669148711.
It is a happy number.
11784196653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11784196653 - 21 = 11784196651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11784196596 and 11784196605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11784196651) 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 7 ways as a sum of consecutive naturals, for example, 18355126 + ... + 18355767.
It is an arithmetic number, because the mean of its divisors is an integer number (1982388276).
Almost surely, 211784196653 is an apocalyptic number.
It is an amenable number.
11784196653 is a deficient number, since it is larger than the sum of its proper divisors (4074909555).
11784196653 is a wasteful number, since it uses less digits than its factorization.
11784196653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36711003.
The product of its digits is 1088640, while the sum is 51.
The spelling of 11784196653 in words is "eleven billion, seven hundred eighty-four million, one hundred ninety-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •