Base | Representation |
---|---|
bin | 11101011001100000111… |
… | …01010011000110001001 |
3 | 10120120022201101001102021 |
4 | 32230300131103012021 |
5 | 113022221324120241 |
6 | 2052014130004441 |
7 | 132656653615141 |
oct | 16546035230611 |
9 | 3516281331367 |
10 | 1010130301321 |
11 | 35a437248249 |
12 | 14392a716721 |
13 | 74340c7898b |
14 | 36c67a07921 |
15 | 1b420cb20d1 |
hex | eb30753189 |
1010130301321 has 2 divisors, whose sum is σ = 1010130301322. Its totient is φ = 1010130301320.
The previous prime is 1010130301307. The next prime is 1010130301373. The reversal of 1010130301321 is 1231030310101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1009550695696 + 579605625 = 1004764^2 + 24075^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010130301321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010130301295 and 1010130301304.
It is not a weakly prime, because it can be changed into another prime (1010130341321) 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, 505065150660 + 505065150661.
It is an arithmetic number, because the mean of its divisors is an integer number (505065150661).
Almost surely, 21010130301321 is an apocalyptic number.
It is an amenable number.
1010130301321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010130301321 is an equidigital number, since it uses as much as digits as its factorization.
1010130301321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1010130301321 its reverse (1231030310101), we get a palindrome (2241160611422).
The spelling of 1010130301321 in words is "one trillion, ten billion, one hundred thirty million, three hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •