Base | Representation |
---|---|
bin | 11101101100010001010… |
… | …10100100111110000001 |
3 | 10121112022111111102210101 |
4 | 32312020222210332001 |
5 | 113203332212041001 |
6 | 2100401245002401 |
7 | 133464336604600 |
oct | 16661052447601 |
9 | 3545274442711 |
10 | 1020200112001 |
11 | 363734404034 |
12 | 14587ab53401 |
13 | 75287269735 |
14 | 3754113da37 |
15 | 1b80ed5ea01 |
hex | ed88aa4f81 |
1020200112001 has 36 divisors (see below), whose sum is σ = 1239371357436. Its totient is φ = 837028657920.
The previous prime is 1020200111993. The next prime is 1020200112067. The reversal of 1020200112001 is 1002110020201.
It can be written as a sum of positive squares in 6 ways, for example, as 18101011600 + 1002099100401 = 134540^2 + 1001049^2 .
It is not a de Polignac number, because 1020200112001 - 23 = 1020200111993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020200112091) 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 in 35 ways as a sum of consecutive naturals, for example, 4248711 + ... + 4482403.
It is an arithmetic number, because the mean of its divisors is an integer number (34426982151).
Almost surely, 21020200112001 is an apocalyptic number.
It is an amenable number.
1020200112001 is a deficient number, since it is larger than the sum of its proper divisors (219171245435).
1020200112001 is an equidigital number, since it uses as much as digits as its factorization.
1020200112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233842 (or 233794 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1020200112001 its reverse (1002110020201), we get a palindrome (2022310132202).
The spelling of 1020200112001 in words is "one trillion, twenty billion, two hundred million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •