Base | Representation |
---|---|
bin | 101101101110101011101101… |
… | …010011110101001011001101 |
3 | 222101002220011222000210021212 |
4 | 231232223231103311023031 |
5 | 202330123001210014404 |
6 | 1551425150240304205 |
7 | 60235310030244002 |
oct | 5556535523651315 |
9 | 871086158023255 |
10 | 201120120001229 |
11 | 590a0622606030 |
12 | 1a682515312065 |
13 | 882b713569410 |
14 | 37943a12cd8a9 |
15 | 183b8e10b206e |
hex | b6eaed4f52cd |
201120120001229 has 8 divisors (see below), whose sum is σ = 236280980141472. Its totient is φ = 168772128672240.
The previous prime is 201120120001133. The next prime is 201120120001237. The reversal of 201120120001229 is 922100021021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201120120001229 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 (201120120001289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 703217202659 + ... + 703217202944.
It is an arithmetic number, because the mean of its divisors is an integer number (29535122517684).
Almost surely, 2201120120001229 is an apocalyptic number.
It is an amenable number.
201120120001229 is a deficient number, since it is larger than the sum of its proper divisors (35160860140243).
201120120001229 is a wasteful number, since it uses less digits than its factorization.
201120120001229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1406434405627.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 201120120001229 in words is "two hundred one trillion, one hundred twenty billion, one hundred twenty million, one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •