Base | Representation |
---|---|
bin | 100001000110101… |
… | …100000011101101 |
3 | 1102201002022120012 |
4 | 201012230003231 |
5 | 2114140321303 |
6 | 131040103005 |
7 | 16522556135 |
oct | 4106540355 |
9 | 1381068505 |
10 | 555401453 |
11 | 265567372 |
12 | 136004a65 |
13 | 8b0b1c19 |
14 | 53a97ac5 |
15 | 33b5d5d8 |
hex | 211ac0ed |
555401453 has 2 divisors, whose sum is σ = 555401454. Its totient is φ = 555401452.
The previous prime is 555401443. The next prime is 555401461. The reversal of 555401453 is 354104555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 304083844 + 251317609 = 17438^2 + 15853^2 .
It is a cyclic number.
It is not a de Polignac number, because 555401453 - 24 = 555401437 is a prime.
It is a super-2 number, since 2×5554014532 = 616941547989022418, which contains 22 as substring.
It is equal to p29113934 and since 555401453 and 29113934 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555401443) 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, 277700726 + 277700727.
It is an arithmetic number, because the mean of its divisors is an integer number (277700727).
Almost surely, 2555401453 is an apocalyptic number.
It is an amenable number.
555401453 is a deficient number, since it is larger than the sum of its proper divisors (1).
555401453 is an equidigital number, since it uses as much as digits as its factorization.
555401453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 555401453 is about 23566.9568039660. The cubic root of 555401453 is about 821.9946744978.
The spelling of 555401453 in words is "five hundred fifty-five million, four hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •