Base | Representation |
---|---|
bin | 11000001010101101… |
… | …11100111010101001 |
3 | 1020111020101100221100 |
4 | 30011112330322221 |
5 | 203033022222044 |
6 | 5543251032013 |
7 | 636346006542 |
oct | 140526747251 |
9 | 36436340840 |
10 | 12974804649 |
11 | 5558a36854 |
12 | 262129b609 |
13 | 12ba0bc901 |
14 | 8b128b4c9 |
15 | 50e126869 |
hex | 3055bcea9 |
12974804649 has 27 divisors (see below), whose sum is σ = 19209120957. Its totient is φ = 8439141816.
The previous prime is 12974804639. The next prime is 12974804659. The reversal of 12974804649 is 94640847921.
The square root of 12974804649 is 113907.
It is a perfect power (a square), and thus also a powerful number.
12974804649 is a `hidden beast` number, since 12 + 97 + 4 + 80 + 464 + 9 = 666.
It is an interprime number because it is at equal distance from previous prime (12974804639) and next prime (12974804659).
It is not a de Polignac number, because 12974804649 - 223 = 12966416041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12974804595 and 12974804604.
It is not an unprimeable number, because it can be changed into a prime (12974804629) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 14693562 + ... + 14694444.
Almost surely, 212974804649 is an apocalyptic number.
12974804649 is the 113907-th square number.
12974804649 is the 56954-th centered octagonal number.
It is an amenable number.
12974804649 is a deficient number, since it is larger than the sum of its proper divisors (6234316308).
12974804649 is an frugal number, since it uses more digits than its factorization.
12974804649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1858 (or 929 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 12974804649 in words is "twelve billion, nine hundred seventy-four million, eight hundred four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •