Base | Representation |
---|---|
bin | 100001000101001… |
… | …010000100100101 |
3 | 1102200022221000022 |
4 | 201011022010211 |
5 | 2114040000401 |
6 | 131023324525 |
7 | 16516265045 |
oct | 4105120445 |
9 | 1380287008 |
10 | 555000101 |
11 | 265312877 |
12 | 135a50745 |
13 | 8aca1336 |
14 | 539d1725 |
15 | 33ace71b |
hex | 2114a125 |
555000101 has 2 divisors, whose sum is σ = 555000102. Its totient is φ = 555000100.
The previous prime is 555000077. The next prime is 555000107. The reversal of 555000101 is 101000555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 346890625 + 208109476 = 18625^2 + 14426^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-555000101 is a prime.
It is a super-2 number, since 2×5550001012 = 616050224220020402, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 555000101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555000107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277500050 + 277500051.
It is an arithmetic number, because the mean of its divisors is an integer number (277500051).
Almost surely, 2555000101 is an apocalyptic number.
It is an amenable number.
555000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
555000101 is an equidigital number, since it uses as much as digits as its factorization.
555000101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 555000101 is about 23558.4401223850. The cubic root of 555000101 is about 821.7966263384.
Adding to 555000101 its reverse (101000555), we get a palindrome (656000656).
The spelling of 555000101 in words is "five hundred fifty-five million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •