Base | Representation |
---|---|
bin | 100001000101010… |
… | …1100110000011101 |
3 | 2212100211222022122 |
4 | 1002022230300131 |
5 | 4233141213041 |
6 | 302053152325 |
7 | 36336463061 |
oct | 10212546035 |
9 | 2770758278 |
10 | 1110101021 |
11 | 51a694367 |
12 | 26b92b6a5 |
13 | 148ca9513 |
14 | a760baa1 |
15 | 676cdc4b |
hex | 422acc1d |
1110101021 has 2 divisors, whose sum is σ = 1110101022. Its totient is φ = 1110101020.
The previous prime is 1110100991. The next prime is 1110101023. The reversal of 1110101021 is 1201010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 860776921 + 249324100 = 29339^2 + 15790^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110101021 - 222 = 1105906717 is a prime.
Together with 1110101023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110101023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555050510 + 555050511.
It is an arithmetic number, because the mean of its divisors is an integer number (555050511).
Almost surely, 21110101021 is an apocalyptic number.
It is an amenable number.
1110101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110101021 is an equidigital number, since it uses as much as digits as its factorization.
1110101021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 8.
The square root of 1110101021 is about 33318.1785366487. The cubic root of 1110101021 is about 1035.4302150129.
Adding to 1110101021 its reverse (1201010111), we get a palindrome (2311111132).
The spelling of 1110101021 in words is "one billion, one hundred ten million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •