Base | Representation |
---|---|
bin | 10101011001001100… |
… | …00110110111100001 |
3 | 1002122110012012112120 |
4 | 22230212012313201 |
5 | 142010303332340 |
6 | 5135412214453 |
7 | 554424014604 |
oct | 125446066741 |
9 | 32573165476 |
10 | 11485605345 |
11 | 4964363325 |
12 | 228660a429 |
13 | 111070c7a6 |
14 | 7ad59a33b |
15 | 4735124d0 |
hex | 2ac986de1 |
11485605345 has 8 divisors (see below), whose sum is σ = 18376968576. Its totient is φ = 6125656176.
The previous prime is 11485605337. The next prime is 11485605359. The reversal of 11485605345 is 54350658411.
11485605345 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 11485605345 - 23 = 11485605337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11485605297 and 11485605306.
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, 382853497 + ... + 382853526.
It is an arithmetic number, because the mean of its divisors is an integer number (2297121072).
Almost surely, 211485605345 is an apocalyptic number.
11485605345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11485605345 is a deficient number, since it is larger than the sum of its proper divisors (6891363231).
11485605345 is an equidigital number, since it uses as much as digits as its factorization.
11485605345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765707031.
The product of its (nonzero) digits is 288000, while the sum is 42.
The spelling of 11485605345 in words is "eleven billion, four hundred eighty-five million, six hundred five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •