Base | Representation |
---|---|
bin | 11101101100010001011… |
… | …10010110011011001001 |
3 | 10121112022120100200110000 |
4 | 32312020232112123021 |
5 | 113203332440213001 |
6 | 2100401322113213 |
7 | 133464351164145 |
oct | 16661056263311 |
9 | 3545276320400 |
10 | 1020201101001 |
11 | 363734a1a095 |
12 | 14587b34b809 |
13 | 75287524944 |
14 | 3754131a225 |
15 | 1b80eea7a86 |
hex | ed88b966c9 |
1020201101001 has 20 divisors (see below), whose sum is σ = 1524035265412. Its totient is φ = 680120165088.
The previous prime is 1020201100967. The next prime is 1020201101009. The reversal of 1020201101001 is 1001011020201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 441293161401 + 578907939600 = 664299^2 + 760860^2 .
It is not a de Polignac number, because 1020201101001 - 213 = 1020201092809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020201101009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5223951 + ... + 5415723.
Almost surely, 21020201101001 is an apocalyptic number.
It is an amenable number.
1020201101001 is a deficient number, since it is larger than the sum of its proper divisors (503834164411).
1020201101001 is an equidigital number, since it uses as much as digits as its factorization.
1020201101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257462 (or 257453 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1020201101001 its reverse (1001011020201), we get a palindrome (2021212121202).
It can be divided in two parts, 102020 and 1101001, that added together give a palindrome (1203021).
The spelling of 1020201101001 in words is "one trillion, twenty billion, two hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •