Base | Representation |
---|---|
bin | 100001000001111… |
… | …000010110111001 |
3 | 1102121201021200221 |
4 | 201001320112321 |
5 | 2113330003423 |
6 | 130553100041 |
7 | 16506056521 |
oct | 4101702671 |
9 | 1377637627 |
10 | 554141113 |
11 | 264886469 |
12 | 1356b7621 |
13 | 8aa60366 |
14 | 5384a681 |
15 | 339aee5d |
hex | 210785b9 |
554141113 has 2 divisors, whose sum is σ = 554141114. Its totient is φ = 554141112.
The previous prime is 554141111. The next prime is 554141131. The reversal of 554141113 is 311141455.
Together with next prime (554141131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 346406544 + 207734569 = 18612^2 + 14413^2 .
It is a cyclic number.
It is not a de Polignac number, because 554141113 - 21 = 554141111 is a prime.
Together with 554141111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (554141111) 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, 277070556 + 277070557.
It is an arithmetic number, because the mean of its divisors is an integer number (277070557).
Almost surely, 2554141113 is an apocalyptic number.
It is an amenable number.
554141113 is a deficient number, since it is larger than the sum of its proper divisors (1).
554141113 is an equidigital number, since it uses as much as digits as its factorization.
554141113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1200, while the sum is 25.
The square root of 554141113 is about 23540.2020594556. The cubic root of 554141113 is about 821.3724354602.
Adding to 554141113 its reverse (311141455), we get a palindrome (865282568).
The spelling of 554141113 in words is "five hundred fifty-four million, one hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •