Base | Representation |
---|---|
bin | 100000010111010… |
… | …0101101101111101 |
3 | 2210200102020010101 |
4 | 1000232211231331 |
5 | 4211001024231 |
6 | 255431441101 |
7 | 35624315251 |
oct | 10056455575 |
9 | 2720366111 |
10 | 1085954941 |
11 | 507aa2025 |
12 | 263826191 |
13 | 143ca3bb6 |
14 | a4324261 |
15 | 6550e661 |
hex | 40ba5b7d |
1085954941 has 2 divisors, whose sum is σ = 1085954942. Its totient is φ = 1085954940.
The previous prime is 1085954939. The next prime is 1085954953. The reversal of 1085954941 is 1494595801.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1074462841 + 11492100 = 32779^2 + 3390^2 .
It is a cyclic number.
It is not a de Polignac number, because 1085954941 - 21 = 1085954939 is a prime.
Together with 1085954939, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1085954891 and 1085954900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1085954911) 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, 542977470 + 542977471.
It is an arithmetic number, because the mean of its divisors is an integer number (542977471).
Almost surely, 21085954941 is an apocalyptic number.
It is an amenable number.
1085954941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085954941 is an equidigital number, since it uses as much as digits as its factorization.
1085954941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 46.
The square root of 1085954941 is about 32953.8304450332. The cubic root of 1085954941 is about 1027.8678175540.
The spelling of 1085954941 in words is "one billion, eighty-five million, nine hundred fifty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.448 sec. • engine limits •