Base | Representation |
---|---|
bin | 110000101100… |
… | …011110100111 |
3 | 220000112102022 |
4 | 300230132213 |
5 | 11231440340 |
6 | 1133333355 |
7 | 213334010 |
oct | 60543647 |
9 | 26015368 |
10 | 12765095 |
11 | 7229672 |
12 | 433725b |
13 | 284c315 |
14 | 19a4007 |
15 | 11c23b5 |
hex | c2c7a7 |
12765095 has 8 divisors (see below), whose sum is σ = 17506464. Its totient is φ = 8753184.
The previous prime is 12765091. The next prime is 12765097. The reversal of 12765095 is 59056721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12765095 - 22 = 12765091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 364717 = 12765095 / (1 + 2 + 7 + 6 + 5 + 0 + 9 + 5).
It is a Duffinian number.
It is a plaindrome in base 6.
It is a zygodrome in base 6.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12765091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182324 + ... + 182393.
It is an arithmetic number, because the mean of its divisors is an integer number (2188308).
Almost surely, 212765095 is an apocalyptic number.
12765095 is a deficient number, since it is larger than the sum of its proper divisors (4741369).
12765095 is an equidigital number, since it uses as much as digits as its factorization.
12765095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364729.
The product of its (nonzero) digits is 18900, while the sum is 35.
The square root of 12765095 is about 3572.8273118078. The cubic root of 12765095 is about 233.7085945706.
The spelling of 12765095 in words is "twelve million, seven hundred sixty-five thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •