Base | Representation |
---|---|
bin | 100001000111010… |
… | …000011010101101 |
3 | 1102201100212212001 |
4 | 201013100122231 |
5 | 2114210103011 |
6 | 131043212301 |
7 | 16524046261 |
oct | 4107203255 |
9 | 1381325761 |
10 | 555550381 |
11 | 265659251 |
12 | 136077091 |
13 | 8b134949 |
14 | 53ad60a1 |
15 | 33b8c7c1 |
hex | 211d06ad |
555550381 has 2 divisors, whose sum is σ = 555550382. Its totient is φ = 555550380.
The previous prime is 555550351. The next prime is 555550469. The reversal of 555550381 is 183055555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 513430281 + 42120100 = 22659^2 + 6490^2 .
It is a cyclic number.
It is not a de Polignac number, because 555550381 - 223 = 547161773 is a prime.
It is a super-2 number, since 2×5555503812 = 617272451658490322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 555550381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555550321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277775190 + 277775191.
It is an arithmetic number, because the mean of its divisors is an integer number (277775191).
Almost surely, 2555550381 is an apocalyptic number.
It is an amenable number.
555550381 is a deficient number, since it is larger than the sum of its proper divisors (1).
555550381 is an equidigital number, since it uses as much as digits as its factorization.
555550381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75000, while the sum is 37.
The square root of 555550381 is about 23570.1162703963. The cubic root of 555550381 is about 822.0681391253.
The spelling of 555550381 in words is "five hundred fifty-five million, five hundred fifty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •