Base | Representation |
---|---|
bin | 10000010101001000010… |
… | …110000100101010110101 |
3 | 10222021121001200021211111 |
4 | 100111020112010222311 |
5 | 121341231223210401 |
6 | 2215310501035021 |
7 | 144035111254105 |
oct | 20251026045265 |
9 | 3867531607744 |
10 | 1122200210101 |
11 | 3a2a16843473 |
12 | 1615a66b5a71 |
13 | 81a91259079 |
14 | 3c459a83205 |
15 | 1e2ce97ae51 |
hex | 10548584ab5 |
1122200210101 has 8 divisors (see below), whose sum is σ = 1161389371320. Its totient is φ = 1083043889088.
The previous prime is 1122200210093. The next prime is 1122200210147. The reversal of 1122200210101 is 1010120022211.
It can be written as a sum of positive squares in 4 ways, for example, as 35287622500 + 1086912587601 = 187850^2 + 1042551^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1122200210101 - 23 = 1122200210093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122200210801) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8140506 + ... + 8277211.
It is an arithmetic number, because the mean of its divisors is an integer number (145173671415).
Almost surely, 21122200210101 is an apocalyptic number.
It is an amenable number.
1122200210101 is a deficient number, since it is larger than the sum of its proper divisors (39189161219).
1122200210101 is a wasteful number, since it uses less digits than its factorization.
1122200210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16420103.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1122200210101 its reverse (1010120022211), we get a palindrome (2132320232312).
The spelling of 1122200210101 in words is "one trillion, one hundred twenty-two billion, two hundred million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •