Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11110100111011110101 |
3 | 10121111210122020011200100 |
4 | 32311330303310323311 |
5 | 113202430302210401 |
6 | 2100325421504313 |
7 | 133456403142636 |
oct | 16657463647365 |
9 | 3544718204610 |
10 | 1020001210101 |
11 | 3636421010a5 |
12 | 145824412099 |
13 | 75254ca81c3 |
14 | 3752296588d |
15 | 1b7ec670b86 |
hex | ed7ccf4ef5 |
1020001210101 has 24 divisors (see below), whose sum is σ = 1519649291160. Its totient is φ = 658782775296.
The previous prime is 1020001210087. The next prime is 1020001210139. The reversal of 1020001210101 is 1010121000201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 320611883076 + 699389327025 = 566226^2 + 836295^2 .
It is not a de Polignac number, because 1020001210101 - 26 = 1020001210037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020001210171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6495516 + ... + 6650693.
It is an arithmetic number, because the mean of its divisors is an integer number (63318720465).
Almost surely, 21020001210101 is an apocalyptic number.
It is an amenable number.
1020001210101 is a deficient number, since it is larger than the sum of its proper divisors (499648081059).
1020001210101 is a wasteful number, since it uses less digits than its factorization.
1020001210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13146485 (or 13146482 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1020001210101 its reverse (1010121000201), we get a palindrome (2030122210302).
The spelling of 1020001210101 in words is "one trillion, twenty billion, one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •