Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …00000101110101100101 |
3 | 10120112222201002101002121 |
4 | 32230220300011311211 |
5 | 113021440224310041 |
6 | 2051553230505541 |
7 | 132653523635443 |
oct | 16545060056545 |
9 | 3515881071077 |
10 | 1010001010021 |
11 | 35a38026a833 |
12 | 1438b33652b1 |
13 | 7432024a953 |
14 | 36c5478db93 |
15 | 1b4147737d1 |
hex | eb28c05d65 |
1010001010021 has 2 divisors, whose sum is σ = 1010001010022. Its totient is φ = 1010001010020.
The previous prime is 1010001010003. The next prime is 1010001010037. The reversal of 1010001010021 is 1200101000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 538154288100 + 471846721921 = 733590^2 + 686911^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010001010021 - 231 = 1007853526373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010001009986 and 1010001010013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010001010001) 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, 505000505010 + 505000505011.
It is an arithmetic number, because the mean of its divisors is an integer number (505000505011).
Almost surely, 21010001010021 is an apocalyptic number.
It is an amenable number.
1010001010021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010001010021 is an equidigital number, since it uses as much as digits as its factorization.
1010001010021 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 7.
Adding to 1010001010021 its reverse (1200101000101), we get a palindrome (2210102010122).
The spelling of 1010001010021 in words is "one trillion, ten billion, one million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •