Base | Representation |
---|---|
bin | 10110101110000101… |
… | …11011000011111000 |
3 | 1011111002022120000001 |
4 | 23113002323003320 |
5 | 144440114132412 |
6 | 5334213122344 |
7 | 611162415430 |
oct | 132702730370 |
9 | 34432276001 |
10 | 12197802232 |
11 | 519a3833a0 |
12 | 24450293b4 |
13 | 11c512c675 |
14 | 839dcb2c0 |
15 | 4b5ce3957 |
hex | 2d70bb0f8 |
12197802232 has 64 divisors (see below), whose sum is σ = 28571097600. Its totient is φ = 4742931840.
The previous prime is 12197802223. The next prime is 12197802241. The reversal of 12197802232 is 23220879121.
It is an interprime number because it is at equal distance from previous prime (12197802223) and next prime (12197802241).
It is a junction number, because it is equal to n+sod(n) for n = 12197802191 and 12197802200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 294093 + ... + 332995.
It is an arithmetic number, because the mean of its divisors is an integer number (446423400).
Almost surely, 212197802232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12197802232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14285548800).
12197802232 is an abundant number, since it is smaller than the sum of its proper divisors (16373295368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12197802232 is a wasteful number, since it uses less digits than its factorization.
12197802232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39436 (or 39432 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 37.
The spelling of 12197802232 in words is "twelve billion, one hundred ninety-seven million, eight hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •