Base | Representation |
---|---|
bin | 10111111001110010… |
… | …00100100010111001 |
3 | 1020010100002102212121 |
4 | 23330321010202321 |
5 | 202240141110344 |
6 | 5521214241241 |
7 | 633002415346 |
oct | 137471044271 |
9 | 36110072777 |
10 | 12832753849 |
11 | 54958339a3 |
12 | 25a17b6221 |
13 | 1296844c96 |
14 | 89a4717cd |
15 | 501917684 |
hex | 2fce448b9 |
12832753849 has 4 divisors (see below), whose sum is σ = 12865078564. Its totient is φ = 12800429136.
The previous prime is 12832753847. The next prime is 12832753859. The reversal of 12832753849 is 94835723821.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94835723821 = 3413 ⋅27786617.
It can be written as a sum of positive squares in 2 ways, for example, as 3807753849 + 9025000000 = 61707^2 + 95000^2 .
It is a cyclic number.
It is not a de Polignac number, because 12832753849 - 21 = 12832753847 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12832753796 and 12832753805.
It is not an unprimeable number, because it can be changed into a prime (12832753847) 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, 16161762 + ... + 16162555.
It is an arithmetic number, because the mean of its divisors is an integer number (3216269641).
Almost surely, 212832753849 is an apocalyptic number.
It is an amenable number.
12832753849 is a deficient number, since it is larger than the sum of its proper divisors (32324715).
12832753849 is an equidigital number, since it uses as much as digits as its factorization.
12832753849 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32324714.
The product of its digits is 2903040, while the sum is 52.
The spelling of 12832753849 in words is "twelve billion, eight hundred thirty-two million, seven hundred fifty-three thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •