Base | Representation |
---|---|
bin | 101110111101… |
… | …000111011001 |
3 | 212011100201011 |
4 | 232331013121 |
5 | 11122341303 |
6 | 1115453521 |
7 | 206424106 |
oct | 56750731 |
9 | 25140634 |
10 | 12308953 |
11 | 6a47998 |
12 | 41572a1 |
13 | 271c807 |
14 | 18c5aad |
15 | 113216d |
hex | bbd1d9 |
12308953 has 4 divisors (see below), whose sum is σ = 12706048. Its totient is φ = 11911860.
The previous prime is 12308951. The next prime is 12308981. The reversal of 12308953 is 35980321.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 35980321 = 13 ⋅2767717.
It is a cyclic number.
It is not a de Polignac number, because 12308953 - 21 = 12308951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 397063 = 12308953 / (1 + 2 + 3 + 0 + 8 + 9 + 5 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12308951) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 198501 + ... + 198562.
It is an arithmetic number, because the mean of its divisors is an integer number (3176512).
Almost surely, 212308953 is an apocalyptic number.
It is an amenable number.
12308953 is a deficient number, since it is larger than the sum of its proper divisors (397095).
12308953 is an equidigital number, since it uses as much as digits as its factorization.
12308953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397094.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 12308953 is about 3508.4117489257. The cubic root of 12308953 is about 230.8910175997.
The spelling of 12308953 in words is "twelve million, three hundred eight thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •