Base | Representation |
---|---|
bin | 10110111100110111… |
… | …00011100001100000 |
3 | 1011210201110012200220 |
4 | 23132123203201200 |
5 | 200213323344221 |
6 | 5354400443040 |
7 | 614225502300 |
oct | 133633434140 |
9 | 34721405626 |
10 | 12321699936 |
11 | 5253307597 |
12 | 247a619480 |
13 | 12149bc710 |
14 | 84c63d600 |
15 | 4c1b190c6 |
hex | 2de6e3860 |
12321699936 has 144 divisors (see below), whose sum is σ = 40519637424. Its totient is φ = 3249662976.
The previous prime is 12321699919. The next prime is 12321699953. The reversal of 12321699936 is 63999612321.
12321699936 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12321699919) and next prime (12321699953).
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 23 ways as a sum of consecutive naturals, for example, 39595 + ... + 161898.
It is an arithmetic number, because the mean of its divisors is an integer number (281386371).
Almost surely, 212321699936 is an apocalyptic number.
12321699936 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12321699936 is an abundant number, since it is smaller than the sum of its proper divisors (28197937488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12321699936 is a wasteful number, since it uses less digits than its factorization.
12321699936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201533 (or 201518 counting only the distinct ones).
The product of its digits is 944784, while the sum is 51.
The spelling of 12321699936 in words is "twelve billion, three hundred twenty-one million, six hundred ninety-nine thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •