Base | Representation |
---|---|
bin | 110000101111… |
… | …010100001011 |
3 | 220001010100200 |
4 | 300233110023 |
5 | 11232323330 |
6 | 1133503243 |
7 | 213412620 |
oct | 60572413 |
9 | 26033320 |
10 | 12776715 |
11 | 7237376 |
12 | 4341b23 |
13 | 28546b3 |
14 | 19a8347 |
15 | 11c5a60 |
hex | c2f50b |
12776715 has 48 divisors (see below), whose sum is σ = 25878528. Its totient is φ = 5709888.
The previous prime is 12776711. The next prime is 12776717. The reversal of 12776715 is 51767721.
12776715 is digitally balanced in base 2 and base 8, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12776715 - 22 = 12776711 is a prime.
12776715 is strictly pandigital in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 12776715.
It is not an unprimeable number, because it can be changed into a prime (12776711) 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, 14374 + ... + 15236.
It is an arithmetic number, because the mean of its divisors is an integer number (539136).
Almost surely, 212776715 is an apocalyptic number.
12776715 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12776715 is an abundant number, since it is smaller than the sum of its proper divisors (13101813).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12776715 is a wasteful number, since it uses less digits than its factorization.
12776715 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 928 (or 925 counting only the distinct ones).
The product of its digits is 20580, while the sum is 36.
The square root of 12776715 is about 3574.4531050218. The cubic root of 12776715 is about 233.7794876390.
The spelling of 12776715 in words is "twelve million, seven hundred seventy-six thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •