Base | Representation |
---|---|
bin | 110000101001… |
… | …010010010111 |
3 | 212222212111011 |
4 | 300221102113 |
5 | 11231031043 |
6 | 1133153051 |
7 | 213250624 |
oct | 60512227 |
9 | 25885434 |
10 | 12752023 |
11 | 721a869 |
12 | 432b787 |
13 | 284639b |
14 | 199d34b |
15 | 11bd59d |
hex | c29497 |
12752023 has 4 divisors (see below), whose sum is σ = 13502160. Its totient is φ = 12001888.
The previous prime is 12752017. The next prime is 12752027. The reversal of 12752023 is 32025721.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12752023 - 221 = 10654871 is a prime.
It is a super-2 number, since 2×127520232 = 325228181185058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12751985 and 12752003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12752027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 375043 + ... + 375076.
It is an arithmetic number, because the mean of its divisors is an integer number (3375540).
Almost surely, 212752023 is an apocalyptic number.
12752023 is a deficient number, since it is larger than the sum of its proper divisors (750137).
12752023 is an equidigital number, since it uses as much as digits as its factorization.
12752023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750136.
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 12752023 is about 3570.9974796967. The cubic root of 12752023 is about 233.6287914781.
Adding to 12752023 its reverse (32025721), we get a palindrome (44777744).
The spelling of 12752023 in words is "twelve million, seven hundred fifty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.373 sec. • engine limits •