Base | Representation |
---|---|
bin | 10111100101110110… |
… | …10011000010101000 |
3 | 1012200200111101101001 |
4 | 23302323103002220 |
5 | 201414341042402 |
6 | 5452443004344 |
7 | 625602346336 |
oct | 136273230250 |
9 | 35620441331 |
10 | 12665565352 |
11 | 540a421790 |
12 | 25558096b4 |
13 | 126b00858b |
14 | 882190b56 |
15 | 4e1de0187 |
hex | 2f2ed30a8 |
12665565352 has 64 divisors (see below), whose sum is σ = 27478362240. Its totient is φ = 5409024000.
The previous prime is 12665565331. The next prime is 12665565377. The reversal of 12665565352 is 25356556621.
It is a happy number.
12665565352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 892053 + ... + 906139.
It is an arithmetic number, because the mean of its divisors is an integer number (429349410).
Almost surely, 212665565352 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 12665565352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13739181120).
12665565352 is an abundant number, since it is smaller than the sum of its proper divisors (14812796888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12665565352 is a wasteful number, since it uses less digits than its factorization.
12665565352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14722 (or 14718 counting only the distinct ones).
The product of its digits is 1620000, while the sum is 46.
The spelling of 12665565352 in words is "twelve billion, six hundred sixty-five million, five hundred sixty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •