Base | Representation |
---|---|
bin | 100000000001000110001… |
… | …101100000010111100001 |
3 | 21210100002210201121111212 |
4 | 200001012031200113201 |
5 | 242022003001413441 |
6 | 4402431455315505 |
7 | 314650015431200 |
oct | 40010615402741 |
9 | 7710083647455 |
10 | 2200201201121 |
11 | 779111245400 |
12 | 2b64b6b1bb95 |
13 | 12c62a46b461 |
14 | 786c1587237 |
15 | 3c373e46eeb |
hex | 200463605e1 |
2200201201121 has 36 divisors (see below), whose sum is σ = 2828788440660. Its totient is φ = 1704969604800.
The previous prime is 2200201201109. The next prime is 2200201201151. The reversal of 2200201201121 is 1211021020022.
It can be written as a sum of positive squares in 2 ways, for example, as 1103573361121 + 1096627840000 = 1050511^2 + 1047200^2 .
It is not a de Polignac number, because 2200201201121 - 238 = 1925323294177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200201201096 and 2200201201105.
It is not an unprimeable number, because it can be changed into a prime (2200201201151) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 48035 + ... + 2098263.
It is an arithmetic number, because the mean of its divisors is an integer number (78577456685).
Almost surely, 22200201201121 is an apocalyptic number.
It is an amenable number.
2200201201121 is a deficient number, since it is larger than the sum of its proper divisors (628587239539).
2200201201121 is a wasteful number, since it uses less digits than its factorization.
2200201201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2050446 (or 2050428 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2200201201121 its reverse (1211021020022), we get a palindrome (3411222221143).
The spelling of 2200201201121 in words is "two trillion, two hundred billion, two hundred one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •