Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …011111110110011110101 |
3 | 11020201221002011201222222 |
4 | 101131301203332303311 |
5 | 124131002442231201 |
6 | 2315210443332125 |
7 | 152466050210342 |
oct | 21356143766365 |
9 | 4221832151888 |
10 | 1200201133301 |
11 | 423003283565 |
12 | 174734b21045 |
13 | 8924217aab1 |
14 | 421391237c9 |
15 | 213476ba91b |
hex | 117718fecf5 |
1200201133301 has 8 divisors (see below), whose sum is σ = 1202951851200. Its totient is φ = 1197450761472.
The previous prime is 1200201133283. The next prime is 1200201133303. The reversal of 1200201133301 is 1033311020021.
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 1200201133301 - 226 = 1200134024437 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1200201133301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200201133303) 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, 7646456 + ... + 7801838.
It is an arithmetic number, because the mean of its divisors is an integer number (150368981400).
Almost surely, 21200201133301 is an apocalyptic number.
It is an amenable number.
1200201133301 is a deficient number, since it is larger than the sum of its proper divisors (2750717899).
1200201133301 is a wasteful number, since it uses less digits than its factorization.
1200201133301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173035.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1200201133301 its reverse (1033311020021), we get a palindrome (2233512153322).
The spelling of 1200201133301 in words is "one trillion, two hundred billion, two hundred one million, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •