Base | Representation |
---|---|
bin | 111100011000011… |
… | …111101010011111 |
3 | 2121121020110222122 |
4 | 330120133222133 |
5 | 4033320212421 |
6 | 244305133155 |
7 | 34050550346 |
oct | 7430375237 |
9 | 2547213878 |
10 | 1013054111 |
11 | 47a92a603 |
12 | 24332a1bb |
13 | 131b5ac04 |
14 | 98788b5d |
15 | 5de0e2ab |
hex | 3c61fa9f |
1013054111 has 2 divisors, whose sum is σ = 1013054112. Its totient is φ = 1013054110.
The previous prime is 1013054087. The next prime is 1013054149. The reversal of 1013054111 is 1114503101.
It is a weak prime.
It is an emirp because it is prime and its reverse (1114503101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013054111 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013054111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013054311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506527055 + 506527056.
It is an arithmetic number, because the mean of its divisors is an integer number (506527056).
Almost surely, 21013054111 is an apocalyptic number.
1013054111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013054111 is an equidigital number, since it uses as much as digits as its factorization.
1013054111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1013054111 is about 31828.5109767956. The cubic root of 1013054111 is about 1004.3325720437.
Adding to 1013054111 its reverse (1114503101), we get a palindrome (2127557212).
The spelling of 1013054111 in words is "one billion, thirteen million, fifty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •