Base | Representation |
---|---|
bin | 10110011110101100… |
… | …10001100100101001 |
3 | 1011011002022022122221 |
4 | 23033112101210221 |
5 | 144204034014244 |
6 | 5313321114041 |
7 | 605033616142 |
oct | 131726214451 |
9 | 34132268587 |
10 | 12068657449 |
11 | 5133495a72 |
12 | 2409928921 |
13 | 11a4453234 |
14 | 826bb0ac9 |
15 | 4a97d3784 |
hex | 2cf591929 |
12068657449 has 8 divisors (see below), whose sum is σ = 12155500800. Its totient is φ = 11981892336.
The previous prime is 12068657441. The next prime is 12068657467. The reversal of 12068657449 is 94475686021.
12068657449 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12068657449 - 23 = 12068657441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12068657396 and 12068657405.
It is not an unprimeable number, because it can be changed into a prime (12068657441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309864 + ... + 346630.
It is an arithmetic number, because the mean of its divisors is an integer number (1519437600).
Almost surely, 212068657449 is an apocalyptic number.
It is an amenable number.
12068657449 is a deficient number, since it is larger than the sum of its proper divisors (86843351).
12068657449 is a wasteful number, since it uses less digits than its factorization.
12068657449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39119.
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 12068657449 in words is "twelve billion, sixty-eight million, six hundred fifty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •