Base | Representation |
---|---|
bin | 11101101101110010000… |
… | …00010010100010000101 |
3 | 10121121102000112101221002 |
4 | 32312321000102202011 |
5 | 113212012321010041 |
6 | 2101013535303045 |
7 | 133523415145400 |
oct | 16667100224205 |
9 | 3547360471832 |
10 | 1021011110021 |
11 | 364010176931 |
12 | 145a6667aa85 |
13 | 753862a0516 |
14 | 375bab2cd37 |
15 | 1b85b15a59b |
hex | edb9012885 |
1021011110021 has 24 divisors (see below), whose sum is σ = 1189577751840. Its totient is φ = 873774693792.
The previous prime is 1021011109961. The next prime is 1021011110047. The reversal of 1021011110021 is 1200111101201.
It is not a de Polignac number, because 1021011110021 - 214 = 1021011093637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021011109984 and 1021011110011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021011110081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 178589255 + ... + 178594971.
It is an arithmetic number, because the mean of its divisors is an integer number (49565739660).
Almost surely, 21021011110021 is an apocalyptic number.
It is an amenable number.
1021011110021 is a deficient number, since it is larger than the sum of its proper divisors (168566641819).
1021011110021 is an equidigital number, since it uses as much as digits as its factorization.
1021011110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10833 (or 10826 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1021011110021 its reverse (1200111101201), we get a palindrome (2221122211222).
The spelling of 1021011110021 in words is "one trillion, twenty-one billion, eleven million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •