Base | Representation |
---|---|
bin | 10101101110011111… |
… | …00000100000001111 |
3 | 1010002220022022001220 |
4 | 22313033200200033 |
5 | 142342020333130 |
6 | 5205232534423 |
7 | 562023215445 |
oct | 126717404017 |
9 | 33086268056 |
10 | 11664230415 |
11 | 4a46176a52 |
12 | 23163b1413 |
13 | 113b7218b6 |
14 | 7c91b6b95 |
15 | 484048410 |
hex | 2b73e080f |
11664230415 has 8 divisors (see below), whose sum is σ = 18662768688. Its totient is φ = 6220922880.
The previous prime is 11664230363. The next prime is 11664230423. The reversal of 11664230415 is 51403246611.
11664230415 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 11664230415 - 212 = 11664226319 is a prime.
It is a super-2 number, since 2×116642304152 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 388807666 + ... + 388807695.
It is an arithmetic number, because the mean of its divisors is an integer number (2332846086).
Almost surely, 211664230415 is an apocalyptic number.
11664230415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11664230415 is a deficient number, since it is larger than the sum of its proper divisors (6998538273).
11664230415 is an equidigital number, since it uses as much as digits as its factorization.
11664230415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777615369.
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 11664230415 in words is "eleven billion, six hundred sixty-four million, two hundred thirty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •