Base | Representation |
---|---|
bin | 110000001001… |
… | …110010111001 |
3 | 212202022112202 |
4 | 300021302321 |
5 | 11212414113 |
6 | 1130315545 |
7 | 212202563 |
oct | 60116271 |
9 | 25668482 |
10 | 12623033 |
11 | 7141965 |
12 | 4288bb5 |
13 | 27cc767 |
14 | 1968333 |
15 | 1195258 |
hex | c09cb9 |
12623033 has 4 divisors (see below), whose sum is σ = 13058340. Its totient is φ = 12187728.
The previous prime is 12623003. The next prime is 12623053. The reversal of 12623033 is 33032621.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4631104 + 7991929 = 2152^2 + 2827^2 .
It is a cyclic number.
It is not a de Polignac number, because 12623033 - 28 = 12622777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12622996 and 12623014.
It is not an unprimeable number, because it can be changed into a prime (12623003) 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, 217610 + ... + 217667.
It is an arithmetic number, because the mean of its divisors is an integer number (3264585).
Almost surely, 212623033 is an apocalyptic number.
It is an amenable number.
12623033 is a deficient number, since it is larger than the sum of its proper divisors (435307).
12623033 is an equidigital number, since it uses as much as digits as its factorization.
12623033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435306.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 12623033 is about 3552.8907948317. The cubic root of 12623033 is about 232.8383819071.
Adding to 12623033 its reverse (33032621), we get a palindrome (45655654).
The spelling of 12623033 in words is "twelve million, six hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •