Base | Representation |
---|---|
bin | 111010110111101100110… |
… | …001001010000001100101 |
3 | 112022202020101201100010202 |
4 | 322313230301022001211 |
5 | 1012240224323102004 |
6 | 12334254400000245 |
7 | 565165111111232 |
oct | 72675461120145 |
9 | 15282211640122 |
10 | 4045536534629 |
11 | 131a77a9a8067 |
12 | 554076000085 |
13 | 234652c14095 |
14 | ddb3ad54789 |
15 | 70378a7bb1e |
hex | 3adecc4a065 |
4045536534629 has 2 divisors, whose sum is σ = 4045536534630. Its totient is φ = 4045536534628.
The previous prime is 4045536534551. The next prime is 4045536534631. The reversal of 4045536534629 is 9264356355404.
4045536534629 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3407771380225 + 637765154404 = 1846015^2 + 798602^2 .
It is a cyclic number.
It is not a de Polignac number, because 4045536534629 - 236 = 3976817057893 is a prime.
Together with 4045536534631, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4045536594629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2022768267314 + 2022768267315.
It is an arithmetic number, because the mean of its divisors is an integer number (2022768267315).
Almost surely, 24045536534629 is an apocalyptic number.
It is an amenable number.
4045536534629 is a deficient number, since it is larger than the sum of its proper divisors (1).
4045536534629 is an equidigital number, since it uses as much as digits as its factorization.
4045536534629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656000, while the sum is 56.
The spelling of 4045536534629 in words is "four trillion, forty-five billion, five hundred thirty-six million, five hundred thirty-four thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •