Base | Representation |
---|---|
bin | 10111100011001110… |
… | …10100101111010111 |
3 | 1012122011002000000200 |
4 | 23301213110233113 |
5 | 201343222132330 |
6 | 5450335111543 |
7 | 625214264160 |
oct | 136147245727 |
9 | 35564060020 |
10 | 12643552215 |
11 | 53a8a56a08 |
12 | 254a3725b3 |
13 | 126659ba58 |
14 | 87d2a0767 |
15 | 4deee2a60 |
hex | 2f19d4bd7 |
12643552215 has 48 divisors (see below), whose sum is σ = 25200035328. Its totient is φ = 5744426688.
The previous prime is 12643552193. The next prime is 12643552219. The reversal of 12643552215 is 51225534621.
12643552215 is a `hidden beast` number, since 1 + 2 + 6 + 435 + 5 + 2 + 215 = 666.
It is not a de Polignac number, because 12643552215 - 220 = 12642503639 is a prime.
It is a super-2 number, since 2×126435522152 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12643552215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12643552219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71779 + ... + 174468.
It is an arithmetic number, because the mean of its divisors is an integer number (525000736).
Almost surely, 212643552215 is an apocalyptic number.
12643552215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12643552215 is a deficient number, since it is larger than the sum of its proper divisors (12556483113).
12643552215 is a wasteful number, since it uses less digits than its factorization.
12643552215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246428 (or 246425 counting only the distinct ones).
The product of its digits is 72000, while the sum is 36.
The spelling of 12643552215 in words is "twelve billion, six hundred forty-three million, five hundred fifty-two thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •