Base | Representation |
---|---|
bin | 11101011010010010001… |
… | …01100110101010010001 |
3 | 10120121101111220202102122 |
4 | 32231021011212222101 |
5 | 113024043120123101 |
6 | 2052123130424025 |
7 | 133003132124402 |
oct | 16551105465221 |
9 | 3517344822378 |
10 | 1010543520401 |
11 | 35a629521918 |
12 | 143a24b92015 |
13 | 743a87680cc |
14 | 36ca684d9a9 |
15 | 1b4471d751b |
hex | eb49166a91 |
1010543520401 has 2 divisors, whose sum is σ = 1010543520402. Its totient is φ = 1010543520400.
The previous prime is 1010543520361. The next prime is 1010543520403. The reversal of 1010543520401 is 1040253450101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 907037188225 + 103506332176 = 952385^2 + 321724^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010543520401 - 238 = 735665613457 is a prime.
Together with 1010543520403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1010543520403) 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, 505271760200 + 505271760201.
It is an arithmetic number, because the mean of its divisors is an integer number (505271760201).
Almost surely, 21010543520401 is an apocalyptic number.
It is an amenable number.
1010543520401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010543520401 is an equidigital number, since it uses as much as digits as its factorization.
1010543520401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 1010543520401 its reverse (1040253450101), we get a palindrome (2050796970502).
The spelling of 1010543520401 in words is "one trillion, ten billion, five hundred forty-three million, five hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •