Base | Representation |
---|---|
bin | 110001000110110010… |
… | …0010001011111010001 |
3 | 101002012021220001212012 |
4 | 1202031210101133101 |
5 | 3211432300431002 |
6 | 120240043512305 |
7 | 10422153566642 |
oct | 1421544213721 |
9 | 332167801765 |
10 | 105454311377 |
11 | 407a5233a58 |
12 | 18530528695 |
13 | 9c3781751c |
14 | 51655c36c9 |
15 | 2b22ed1d52 |
hex | 188d9117d1 |
105454311377 has 2 divisors, whose sum is σ = 105454311378. Its totient is φ = 105454311376.
The previous prime is 105454311371. The next prime is 105454311397. The reversal of 105454311377 is 773113454501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103612528321 + 1841783056 = 321889^2 + 42916^2 .
It is a cyclic number.
It is not a de Polignac number, because 105454311377 - 214 = 105454294993 is a prime.
It is a super-2 number, since 2×1054543113772 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105454311371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52727155688 + 52727155689.
It is an arithmetic number, because the mean of its divisors is an integer number (52727155689).
Almost surely, 2105454311377 is an apocalyptic number.
It is an amenable number.
105454311377 is a deficient number, since it is larger than the sum of its proper divisors (1).
105454311377 is an equidigital number, since it uses as much as digits as its factorization.
105454311377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 176400, while the sum is 41.
Adding to 105454311377 its reverse (773113454501), we get a palindrome (878567765878).
The spelling of 105454311377 in words is "one hundred five billion, four hundred fifty-four million, three hundred eleven thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •