Base | Representation |
---|---|
bin | 10101110000100001… |
… | …00000011110000000 |
3 | 1010011002100222111000 |
4 | 22320100200132000 |
5 | 142410401112012 |
6 | 5211042052000 |
7 | 562321103454 |
oct | 127020403600 |
9 | 33132328430 |
10 | 11681269632 |
11 | 4a5485484a |
12 | 232004a000 |
13 | 1142109486 |
14 | 7cb570664 |
15 | 4857b1ddc |
hex | 2b8420780 |
11681269632 has 64 divisors (see below), whose sum is σ = 34475979600. Its totient is φ = 3893755392.
The previous prime is 11681269631. The next prime is 11681269643. The reversal of 11681269632 is 23696218611.
11681269632 is a `hidden beast` number, since 1 + 1 + 6 + 8 + 1 + 2 + 6 + 9 + 632 = 666.
It is a tau number, because it is divible by the number of its divisors (64).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11681269631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1686543 + ... + 1693454.
Almost surely, 211681269632 is an apocalyptic number.
11681269632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11681269632 is an abundant number, since it is smaller than the sum of its proper divisors (22794709968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11681269632 is an equidigital number, since it uses as much as digits as its factorization.
11681269632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3380020 (or 3380002 counting only the distinct ones).
The product of its digits is 186624, while the sum is 45.
The spelling of 11681269632 in words is "eleven billion, six hundred eighty-one million, two hundred sixty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •