Base | Representation |
---|---|
bin | 10000010011010001001… |
… | …000101000111101000001 |
3 | 10222002102200022020202100 |
4 | 100103101020220331001 |
5 | 121323132222400001 |
6 | 2214340213541013 |
7 | 143634414410631 |
oct | 20232110507501 |
9 | 3862380266670 |
10 | 1120200200001 |
11 | 3a208a89a263 |
12 | 161128944769 |
13 | 81832aaa23c |
14 | 3c30a1c46c1 |
15 | 1e2140b5586 |
hex | 104d1228f41 |
1120200200001 has 24 divisors (see below), whose sum is σ = 1624553788520. Its totient is φ = 743810086656.
The previous prime is 1120200199981. The next prime is 1120200200003. The reversal of 1120200200001 is 1000020020211.
It can be written as a sum of positive squares in 4 ways, for example, as 198024110001 + 922176090000 = 444999^2 + 960300^2 .
It is not a de Polignac number, because 1120200200001 - 226 = 1120133091137 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 (1120200200003) 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, 3323895 + ... + 3645363.
Almost surely, 21120200200001 is an apocalyptic number.
It is an amenable number.
1120200200001 is a deficient number, since it is larger than the sum of its proper divisors (504353588519).
1120200200001 is a wasteful number, since it uses less digits than its factorization.
1120200200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323025 (or 323022 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1120200200001 its reverse (1000020020211), we get a palindrome (2120220220212).
It can be divided in two parts, 1120200 and 200001, that added together give a square (1320201 = 11492).
The spelling of 1120200200001 in words is "one trillion, one hundred twenty billion, two hundred million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •