Base | Representation |
---|---|
bin | 100001000101001… |
… | …110001000100101 |
3 | 1102200100202211121 |
4 | 201011032020211 |
5 | 2114041013431 |
6 | 131023533541 |
7 | 16516364416 |
oct | 4105161045 |
9 | 1380322747 |
10 | 555016741 |
11 | 265324324 |
12 | 135a5a2b1 |
13 | 8aca8a96 |
14 | 539d780d |
15 | 33ad4611 |
hex | 2114e225 |
555016741 has 2 divisors, whose sum is σ = 555016742. Its totient is φ = 555016740.
The previous prime is 555016723. The next prime is 555016747. The reversal of 555016741 is 147610555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 531533025 + 23483716 = 23055^2 + 4846^2 .
It is a cyclic number.
It is not a de Polignac number, because 555016741 - 213 = 555008549 is a prime.
It is a super-2 number, since 2×5550167412 = 616087165580522162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 555016697 and 555016706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555016747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277508370 + 277508371.
It is an arithmetic number, because the mean of its divisors is an integer number (277508371).
Almost surely, 2555016741 is an apocalyptic number.
It is an amenable number.
555016741 is a deficient number, since it is larger than the sum of its proper divisors (1).
555016741 is an equidigital number, since it uses as much as digits as its factorization.
555016741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 34.
The square root of 555016741 is about 23558.7932840373. The cubic root of 555016741 is about 821.8048392854.
The spelling of 555016741 in words is "five hundred fifty-five million, sixteen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •