Base | Representation |
---|---|
bin | 1011110010000111100101… |
… | …1000110111001101001001 |
3 | 1200212112211002001202021001 |
4 | 2330201321120313031021 |
5 | 3144231141412103244 |
6 | 43315425212015001 |
7 | 2505005165236201 |
oct | 274417130671511 |
9 | 50775732052231 |
10 | 12955657925449 |
11 | 4145511166898 |
12 | 1552a87761461 |
13 | 72c937174795 |
14 | 32b0b2cdb401 |
15 | 1770168a95d4 |
hex | bc879637349 |
12955657925449 has 4 divisors (see below), whose sum is σ = 12956384686864. Its totient is φ = 12954931164036.
The previous prime is 12955657925381. The next prime is 12955657925477. The reversal of 12955657925449 is 94452975655921.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12955657925449 - 229 = 12955121054537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12955657925849) 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 3 ways as a sum of consecutive naturals, for example, 363353967 + ... + 363389620.
It is an arithmetic number, because the mean of its divisors is an integer number (3239096171716).
Almost surely, 212955657925449 is an apocalyptic number.
It is an amenable number.
12955657925449 is a deficient number, since it is larger than the sum of its proper divisors (726761415).
12955657925449 is an equidigital number, since it uses as much as digits as its factorization.
12955657925449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726761414.
The product of its digits is 1224720000, while the sum is 73.
The spelling of 12955657925449 in words is "twelve trillion, nine hundred fifty-five billion, six hundred fifty-seven million, nine hundred twenty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •