Base | Representation |
---|---|
bin | 10110110011111010… |
… | …11110111001111001 |
3 | 1011121111100012212121 |
4 | 23121331132321321 |
5 | 200040124122313 |
6 | 5343121241241 |
7 | 612325204363 |
oct | 133175367171 |
9 | 34544305777 |
10 | 12246707833 |
11 | 5214a46948 |
12 | 2459493221 |
13 | 12022c38a9 |
14 | 8426bbd33 |
15 | 4ba25428d |
hex | 2d9f5ee79 |
12246707833 has 8 divisors (see below), whose sum is σ = 12537394056. Its totient is φ = 11959344000.
The previous prime is 12246707819. The next prime is 12246707867. The reversal of 12246707833 is 33870764221.
It can be written as a sum of positive squares in 4 ways, for example, as 9176107264 + 3070600569 = 95792^2 + 55413^2 .
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 12246707833 - 229 = 11709836921 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12246707833.
It is not an unprimeable number, because it can be changed into a prime (12246701833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 823138 + ... + 837883.
It is an arithmetic number, because the mean of its divisors is an integer number (1567174257).
Almost surely, 212246707833 is an apocalyptic number.
It is an amenable number.
12246707833 is a deficient number, since it is larger than the sum of its proper divisors (290686223).
12246707833 is a wasteful number, since it uses less digits than its factorization.
12246707833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661195.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 12246707833 in words is "twelve billion, two hundred forty-six million, seven hundred seven thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •