Base | Representation |
---|---|
bin | 101110001000… |
… | …110110000101 |
3 | 211202111000112 |
4 | 232020312011 |
5 | 11044013403 |
6 | 1111122405 |
7 | 204542651 |
oct | 56106605 |
9 | 24674015 |
10 | 12094853 |
11 | 6911051 |
12 | 4073405 |
13 | 2676224 |
14 | 186ba61 |
15 | 10dd9d8 |
hex | b88d85 |
12094853 has 4 divisors (see below), whose sum is σ = 12103980. Its totient is φ = 12085728.
The previous prime is 12094847. The next prime is 12094891. The reversal of 12094853 is 35849021.
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: 35849021 = 13 ⋅2757617.
It can be written as a sum of positive squares in 2 ways, for example, as 11607649 + 487204 = 3407^2 + 698^2 .
It is a cyclic number.
It is not a de Polignac number, because 12094853 - 222 = 7900549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12094813) 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, 2150 + ... + 5367.
It is an arithmetic number, because the mean of its divisors is an integer number (3025995).
Almost surely, 212094853 is an apocalyptic number.
It is an amenable number.
12094853 is a deficient number, since it is larger than the sum of its proper divisors (9127).
12094853 is an equidigital number, since it uses as much as digits as its factorization.
12094853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9126.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 12094853 is about 3477.7655182603. The cubic root of 12094853 is about 229.5444859756.
The spelling of 12094853 in words is "twelve million, ninety-four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •