Base | Representation |
---|---|
bin | 10101110001101101… |
… | …10100110010110000 |
3 | 1010011210021022020200 |
4 | 22320312310302300 |
5 | 142420434024402 |
6 | 5212041235200 |
7 | 562502350404 |
oct | 127066646260 |
9 | 33153238220 |
10 | 11691314352 |
11 | 4a5a495573 |
12 | 2323492b00 |
13 | 11442154b3 |
14 | 7cca27104 |
15 | 4865e821c |
hex | 2b8db4cb0 |
11691314352 has 30 divisors (see below), whose sum is σ = 32719442652. Its totient is φ = 3897104736.
The previous prime is 11691314317. The next prime is 11691314377. The reversal of 11691314352 is 25341319611.
11691314352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 5 ways as a sum of consecutive naturals, for example, 40594698 + ... + 40594985.
Almost surely, 211691314352 is an apocalyptic number.
11691314352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11691314352 is an abundant number, since it is smaller than the sum of its proper divisors (21028128300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11691314352 is a wasteful number, since it uses less digits than its factorization.
11691314352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81189697 (or 81189688 counting only the distinct ones).
The product of its digits is 19440, while the sum is 36.
The spelling of 11691314352 in words is "eleven billion, six hundred ninety-one million, three hundred fourteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •