Base | Representation |
---|---|
bin | 10010110001010001… |
… | …10111110000011101 |
3 | 222000021201212021021 |
4 | 21120220313300131 |
5 | 131114210344431 |
6 | 4343534004141 |
7 | 504501313162 |
oct | 113050676035 |
9 | 28007655237 |
10 | 10077043741 |
11 | 4301257126 |
12 | 1b52946651 |
13 | c4795409b |
14 | 6b849a069 |
15 | 3dea2ab11 |
hex | 258a37c1d |
10077043741 has 2 divisors, whose sum is σ = 10077043742. Its totient is φ = 10077043740.
The previous prime is 10077043733. The next prime is 10077043747. The reversal of 10077043741 is 14734077001.
It is a happy number.
10077043741 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., 9898260100 + 178783641 = 99490^2 + 13371^2 .
It is a cyclic number.
It is not a de Polignac number, because 10077043741 - 23 = 10077043733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10077043697 and 10077043706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10077043747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5038521870 + 5038521871.
It is an arithmetic number, because the mean of its divisors is an integer number (5038521871).
Almost surely, 210077043741 is an apocalyptic number.
It is an amenable number.
10077043741 is a deficient number, since it is larger than the sum of its proper divisors (1).
10077043741 is an equidigital number, since it uses as much as digits as its factorization.
10077043741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16464, while the sum is 34.
The spelling of 10077043741 in words is "ten billion, seventy-seven million, forty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •