Base | Representation |
---|---|
bin | 11101011001101101000… |
… | …10000101110101011101 |
3 | 10120120120211011002221222 |
4 | 32230312202011311131 |
5 | 113022423422033041 |
6 | 2052032210303125 |
7 | 132662332124132 |
oct | 16546642056535 |
9 | 3516524132858 |
10 | 1010232221021 |
11 | 35a489830001 |
12 | 143958887aa5 |
13 | 743591121aa |
14 | 36c77378589 |
15 | 1b429be574b |
hex | eb36885d5d |
1010232221021 has 2 divisors, whose sum is σ = 1010232221022. Its totient is φ = 1010232221020.
The previous prime is 1010232220993. The next prime is 1010232221023. The reversal of 1010232221021 is 1201222320101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 522454296100 + 487777924921 = 722810^2 + 698411^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010232221021 is a prime.
It is a Sophie Germain prime.
Together with 1010232221023, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010232221023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505116110510 + 505116110511.
It is an arithmetic number, because the mean of its divisors is an integer number (505116110511).
Almost surely, 21010232221021 is an apocalyptic number.
It is an amenable number.
1010232221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010232221021 is an equidigital number, since it uses as much as digits as its factorization.
1010232221021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1010232221021 its reverse (1201222320101), we get a palindrome (2211454541122).
The spelling of 1010232221021 in words is "one trillion, ten billion, two hundred thirty-two million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •