Base | Representation |
---|---|
bin | 111110111000100… |
… | …100000011100101 |
3 | 2201112012022200212 |
4 | 332320210003211 |
5 | 4130040441031 |
6 | 252404345205 |
7 | 35100323615 |
oct | 7670440345 |
9 | 2645168625 |
10 | 1055015141 |
11 | 4a158a544 |
12 | 2553a5205 |
13 | 13a76021b |
14 | a018ca45 |
15 | 6294c12b |
hex | 3ee240e5 |
1055015141 has 2 divisors, whose sum is σ = 1055015142. Its totient is φ = 1055015140.
The previous prime is 1055015131. The next prime is 1055015149. The reversal of 1055015141 is 1415105501.
1055015141 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., 714760225 + 340254916 = 26735^2 + 18446^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055015141 is a prime.
It is a super-3 number, since 3×10550151413 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055015149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527507570 + 527507571.
It is an arithmetic number, because the mean of its divisors is an integer number (527507571).
Almost surely, 21055015141 is an apocalyptic number.
It is an amenable number.
1055015141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055015141 is an equidigital number, since it uses as much as digits as its factorization.
1055015141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 500, while the sum is 23.
The square root of 1055015141 is about 32480.9966134046. The cubic root of 1055015141 is about 1018.0120002883.
The spelling of 1055015141 in words is "one billion, fifty-five million, fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •