Base | Representation |
---|---|
bin | 10110111100111011… |
… | …00110110100000000 |
3 | 1011210202110112100221 |
4 | 23132131212310000 |
5 | 200213443101241 |
6 | 5354420152424 |
7 | 614233202146 |
oct | 133635466400 |
9 | 34722415327 |
10 | 12322237696 |
11 | 525364461a |
12 | 247a838714 |
13 | 1214b4a412 |
14 | 84c73d596 |
15 | 4c1bc35d1 |
hex | 2de766d00 |
12322237696 has 36 divisors (see below), whose sum is σ = 24606618372. Its totient is φ = 6158544896.
The previous prime is 12322237693. The next prime is 12322237723. The reversal of 12322237696 is 69673222321.
12322237696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 1187767296 + 11134470400 = 34464^2 + 105520^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12322237691) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 702246 + ... + 719578.
It is an arithmetic number, because the mean of its divisors is an integer number (683517177).
Almost surely, 212322237696 is an apocalyptic number.
12322237696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12322237696 is a deficient number, since it is larger than the sum of its proper divisors (12284380676).
12322237696 is an equidigital number, since it uses as much as digits as its factorization.
12322237696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20126 (or 20112 counting only the distinct ones).
The product of its digits is 326592, while the sum is 43.
The spelling of 12322237696 in words is "twelve billion, three hundred twenty-two million, two hundred thirty-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •