Base | Representation |
---|---|
bin | 10111011111110110… |
… | …01111101111110111 |
3 | 1012120011202120211100 |
4 | 23233323033233313 |
5 | 201313444021330 |
6 | 5443443541143 |
7 | 624421413453 |
oct | 135773175767 |
9 | 35504676740 |
10 | 12615220215 |
11 | 5393a65734 |
12 | 254098a7b3 |
13 | 126075c060 |
14 | 879607663 |
15 | 4dc798060 |
hex | 2efecfbf7 |
12615220215 has 48 divisors (see below), whose sum is σ = 23832218592. Its totient is φ = 6135720192.
The previous prime is 12615220213. The next prime is 12615220217. The reversal of 12615220215 is 51202251621.
12615220215 is a `hidden beast` number, since 1 + 2 + 615 + 2 + 20 + 21 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (12615220213) and next prime (12615220217).
It is not a de Polignac number, because 12615220215 - 21 = 12615220213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12615220213) 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, 81352 + ... + 178461.
It is an arithmetic number, because the mean of its divisors is an integer number (496504554).
Almost surely, 212615220215 is an apocalyptic number.
12615220215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12615220215 is a deficient number, since it is larger than the sum of its proper divisors (11216998377).
12615220215 is a wasteful number, since it uses less digits than its factorization.
12615220215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259920 (or 259917 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 12615220215 its reverse (51202251621), we get a palindrome (63817471836).
The spelling of 12615220215 in words is "twelve billion, six hundred fifteen million, two hundred twenty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •