Base | Representation |
---|---|
bin | 10110101010101101… |
… | …11101000101000101 |
3 | 1011102010001121012022 |
4 | 23111112331011011 |
5 | 144410342431244 |
6 | 5331322332525 |
7 | 610400014526 |
oct | 132526750505 |
9 | 34363047168 |
10 | 12169498949 |
11 | 5185401753 |
12 | 243765a145 |
13 | 11bc2cca6a |
14 | 83634084d |
15 | 4b35a26ee |
hex | 2d55bd145 |
12169498949 has 4 divisors (see below), whose sum is σ = 12498404364. Its totient is φ = 11840593536.
The previous prime is 12169498921. The next prime is 12169498961. The reversal of 12169498949 is 94989496121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8555325025 + 3614173924 = 92495^2 + 60118^2 .
It is a cyclic number.
It is not a de Polignac number, because 12169498949 - 232 = 7874531653 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12169498891 and 12169498900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12169498969) 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, 164452652 + ... + 164452725.
It is an arithmetic number, because the mean of its divisors is an integer number (3124601091).
Almost surely, 212169498949 is an apocalyptic number.
It is an amenable number.
12169498949 is a deficient number, since it is larger than the sum of its proper divisors (328905415).
12169498949 is an equidigital number, since it uses as much as digits as its factorization.
12169498949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328905414.
The product of its digits is 10077696, while the sum is 62.
The spelling of 12169498949 in words is "twelve billion, one hundred sixty-nine million, four hundred ninety-eight thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •