Base | Representation |
---|---|
bin | 100000111100011… |
… | …1000001100001101 |
3 | 2212001001121212111 |
4 | 1001320320030031 |
5 | 4230442214021 |
6 | 301405104021 |
7 | 36251664556 |
oct | 10170701415 |
9 | 2761047774 |
10 | 1105429261 |
11 | 517a93402 |
12 | 26a258011 |
13 | 148031c71 |
14 | a6b5332d |
15 | 670a98e1 |
hex | 41e3830d |
1105429261 has 2 divisors, whose sum is σ = 1105429262. Its totient is φ = 1105429260.
The previous prime is 1105429229. The next prime is 1105429271. The reversal of 1105429261 is 1629245011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 762809161 + 342620100 = 27619^2 + 18510^2 .
It is an emirp because it is prime and its reverse (1629245011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105429261 - 25 = 1105429229 is a prime.
It is a super-2 number, since 2×11054292612 = 2443947702150012242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105429201) 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, 552714630 + 552714631.
It is an arithmetic number, because the mean of its divisors is an integer number (552714631).
Almost surely, 21105429261 is an apocalyptic number.
It is an amenable number.
1105429261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105429261 is an equidigital number, since it uses as much as digits as its factorization.
1105429261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 1105429261 is about 33247.9963456446. The cubic root of 1105429261 is about 1033.9756677739.
The spelling of 1105429261 in words is "one billion, one hundred five million, four hundred twenty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •