Base | Representation |
---|---|
bin | 111111001000101… |
… | …100000001110101 |
3 | 2201211011001222221 |
4 | 333020230001311 |
5 | 4132131221401 |
6 | 253035122341 |
7 | 35151260251 |
oct | 7710540165 |
9 | 2654131887 |
10 | 1059242101 |
11 | 4a3a072a5 |
12 | 2568a33b1 |
13 | 13b5b0198 |
14 | a096d261 |
15 | 62ed47a1 |
hex | 3f22c075 |
1059242101 has 2 divisors, whose sum is σ = 1059242102. Its totient is φ = 1059242100.
The previous prime is 1059242071. The next prime is 1059242123. The reversal of 1059242101 is 1012429501.
It is a happy number.
1059242101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 915002001 + 144240100 = 30249^2 + 12010^2 .
It is a cyclic number.
It is not a de Polignac number, because 1059242101 - 211 = 1059240053 is a prime.
It is a super-2 number, since 2×10592421012 = 2243987657061788402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1059242201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529621050 + 529621051.
It is an arithmetic number, because the mean of its divisors is an integer number (529621051).
Almost surely, 21059242101 is an apocalyptic number.
It is an amenable number.
1059242101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1059242101 is an equidigital number, since it uses as much as digits as its factorization.
1059242101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 25.
The square root of 1059242101 is about 32545.9997695569. Note that the first 3 decimals coincide. The cubic root of 1059242101 is about 1019.3697570805.
The spelling of 1059242101 in words is "one billion, fifty-nine million, two hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •