Base | Representation |
---|---|
bin | 101111010011… |
… | …001101001001 |
3 | 212022221211021 |
4 | 233103031021 |
5 | 11133240213 |
6 | 1121432441 |
7 | 210251644 |
oct | 57231511 |
9 | 25287737 |
10 | 12399433 |
11 | 6aa9972 |
12 | 419b721 |
13 | 2751a57 |
14 | 190aa5b |
15 | 114dd8d |
hex | bd3349 |
12399433 has 4 divisors (see below), whose sum is σ = 12409540. Its totient is φ = 12389328.
The previous prime is 12399427. The next prime is 12399451. The reversal of 12399433 is 33499321.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 33499321 = 29 ⋅1155149.
It can be written as a sum of positive squares in 2 ways, for example, as 1882384 + 10517049 = 1372^2 + 3243^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12399433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12399463) 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 3 ways as a sum of consecutive naturals, for example, 2910 + ... + 5767.
It is an arithmetic number, because the mean of its divisors is an integer number (3102385).
Almost surely, 212399433 is an apocalyptic number.
It is an amenable number.
12399433 is a deficient number, since it is larger than the sum of its proper divisors (10107).
12399433 is an equidigital number, since it uses as much as digits as its factorization.
12399433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10106.
The product of its digits is 17496, while the sum is 34.
The square root of 12399433 is about 3521.2828628214. The cubic root of 12399433 is about 231.4553775171.
The spelling of 12399433 in words is "twelve million, three hundred ninety-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •