Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …10101000100101100101 |
3 | 10120010111121120212101122 |
4 | 32220133202220211211 |
5 | 112433332142120401 |
6 | 2045535522503325 |
7 | 132435334615562 |
oct | 16503742504545 |
9 | 3503447525348 |
10 | 1005551520101 |
11 | 3584a7689137 |
12 | 142a71204b45 |
13 | 73a9147a78b |
14 | 36951871869 |
15 | 1b253d1121b |
hex | ea1f8a8965 |
1005551520101 has 2 divisors, whose sum is σ = 1005551520102. Its totient is φ = 1005551520100.
The previous prime is 1005551520073. The next prime is 1005551520167. The reversal of 1005551520101 is 1010251555001.
1005551520101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 843227139076 + 162324381025 = 918274^2 + 402895^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1005551520101 is a prime.
It is a super-2 number, since 2×10055515201012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1005551523101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502775760050 + 502775760051.
It is an arithmetic number, because the mean of its divisors is an integer number (502775760051).
Almost surely, 21005551520101 is an apocalyptic number.
It is an amenable number.
1005551520101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005551520101 is an equidigital number, since it uses as much as digits as its factorization.
1005551520101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1250, while the sum is 26.
The spelling of 1005551520101 in words is "one trillion, five billion, five hundred fifty-one million, five hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •