Base | Representation |
---|---|
bin | 101110010101… |
… | …010010100111 |
3 | 211212001221121 |
4 | 232111102213 |
5 | 11102131311 |
6 | 1112154411 |
7 | 205144405 |
oct | 56252247 |
9 | 24761847 |
10 | 12145831 |
11 | 6946385 |
12 | 4098a07 |
13 | 26934a9 |
14 | 1882475 |
15 | 10edb71 |
hex | b954a7 |
12145831 has 4 divisors (see below), whose sum is σ = 12537664. Its totient is φ = 11754000.
The previous prime is 12145829. The next prime is 12145843. The reversal of 12145831 is 13854121.
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 12145831 - 21 = 12145829 is a prime.
It is a super-2 number, since 2×121458312 = 295042421361122, 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 = 12145796 and 12145805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12145801) 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, 195870 + ... + 195931.
It is an arithmetic number, because the mean of its divisors is an integer number (3134416).
Almost surely, 212145831 is an apocalyptic number.
12145831 is a deficient number, since it is larger than the sum of its proper divisors (391833).
12145831 is an equidigital number, since it uses as much as digits as its factorization.
12145831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391832.
The product of its digits is 960, while the sum is 25.
The square root of 12145831 is about 3485.0869429614. The cubic root of 12145831 is about 229.8665325206.
Adding to 12145831 its reverse (13854121), we get a palindrome (25999952).
The spelling of 12145831 in words is "twelve million, one hundred forty-five thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •