Base | Representation |
---|---|
bin | 11011010100001001101001… |
… | …010111010111101101001011 |
3 | 120202100111200211201101102101 |
4 | 123110021221113113231023 |
5 | 111221220320232100321 |
6 | 1103255514051214231 |
7 | 34206152011202053 |
oct | 3324115127275513 |
9 | 522314624641371 |
10 | 120132003003211 |
11 | 353067729512a1 |
12 | 115824788a7377 |
13 | 520552628a7b4 |
14 | 21945c4576563 |
15 | dd4d98271791 |
hex | 6d42695d7b4b |
120132003003211 has 8 divisors (see below), whose sum is σ = 131952772177920. Its totient is φ = 108861037045992.
The previous prime is 120132003003163. The next prime is 120132003003227. The reversal of 120132003003211 is 112300300231021.
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 120132003003211 - 217 = 120132002872139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120132003003241) 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, 137450803915 + ... + 137450804788.
It is an arithmetic number, because the mean of its divisors is an integer number (16494096522240).
Almost surely, 2120132003003211 is an apocalyptic number.
120132003003211 is a deficient number, since it is larger than the sum of its proper divisors (11820769174709).
120132003003211 is a wasteful number, since it uses less digits than its factorization.
120132003003211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274901608745.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 120132003003211 its reverse (112300300231021), we get a palindrome (232432303234232).
The spelling of 120132003003211 in words is "one hundred twenty trillion, one hundred thirty-two billion, three million, three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •