Base | Representation |
---|---|
bin | 100110000101011110110… |
… | …0000101100000111010001 |
3 | 200112102000210110022122211 |
4 | 1030022331200230013101 |
5 | 1141230123101122044 |
6 | 15044401205432121 |
7 | 1050114353506162 |
oct | 114127540540721 |
9 | 20472023408584 |
10 | 5234449629649 |
11 | 1738a10399369 |
12 | 70657a70b641 |
13 | 2bc7b6597186 |
14 | 1414c4c29769 |
15 | 9126025d634 |
hex | 4c2bd82c1d1 |
5234449629649 has 2 divisors, whose sum is σ = 5234449629650. Its totient is φ = 5234449629648.
The previous prime is 5234449629611. The next prime is 5234449629709. The reversal of 5234449629649 is 9469269444325.
5234449629649 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4600424419600 + 634025210049 = 2144860^2 + 796257^2 .
It is a cyclic number.
It is not a de Polignac number, because 5234449629649 - 29 = 5234449629137 is a prime.
It is not a weakly prime, because it can be changed into another prime (5234449629449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2617224814824 + 2617224814825.
It is an arithmetic number, because the mean of its divisors is an integer number (2617224814825).
Almost surely, 25234449629649 is an apocalyptic number.
It is an amenable number.
5234449629649 is a deficient number, since it is larger than the sum of its proper divisors (1).
5234449629649 is an equidigital number, since it uses as much as digits as its factorization.
5234449629649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 403107840, while the sum is 67.
The spelling of 5234449629649 in words is "five trillion, two hundred thirty-four billion, four hundred forty-nine million, six hundred twenty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •