Base | Representation |
---|---|
bin | 10110010010010000… |
… | …10001111101000000 |
3 | 1010212210222201101221 |
4 | 23021020101331000 |
5 | 144000331410241 |
6 | 5255113004424 |
7 | 602326043011 |
oct | 131110217500 |
9 | 33783881357 |
10 | 11964325696 |
11 | 508a605a84 |
12 | 239a9b3714 |
13 | 1188953b7b |
14 | 816db3008 |
15 | 4a05755d1 |
hex | 2c9211f40 |
11964325696 has 56 divisors (see below), whose sum is σ = 24104498400. Its totient is φ = 5891415552.
The previous prime is 11964325693. The next prime is 11964325727. The reversal of 11964325696 is 69652346911.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11964325691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1179655 + ... + 1189753.
Almost surely, 211964325696 is an apocalyptic number.
11964325696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11964325696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12052249200).
11964325696 is an abundant number, since it is smaller than the sum of its proper divisors (12140172704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11964325696 is a wasteful number, since it uses less digits than its factorization.
11964325696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10391 (or 10381 counting only the distinct ones).
The product of its digits is 2099520, while the sum is 52.
The spelling of 11964325696 in words is "eleven billion, nine hundred sixty-four million, three hundred twenty-five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •