Base | Representation |
---|---|
bin | 10001011101111000101… |
… | …110000000001111101101 |
3 | 11020202020110002211002201 |
4 | 101131320232000033231 |
5 | 124131224211414013 |
6 | 2315230413021501 |
7 | 152502035603335 |
oct | 21357056001755 |
9 | 4222213084081 |
10 | 1200321201133 |
11 | 42306503127a |
12 | 174769184891 |
13 | 89260cc9852 |
14 | 4214b05a0c5 |
15 | 21352ed63dd |
hex | 11778b803ed |
1200321201133 has 8 divisors (see below), whose sum is σ = 1210447060352. Its totient is φ = 1190226740976.
The previous prime is 1200321201119. The next prime is 1200321201151. The reversal of 1200321201133 is 3311021230021.
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 1200321201133 - 29 = 1200321200621 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 1200321201133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200321201193) 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, 7772985 + ... + 7925902.
It is an arithmetic number, because the mean of its divisors is an integer number (151305882544).
Almost surely, 21200321201133 is an apocalyptic number.
It is an amenable number.
1200321201133 is a deficient number, since it is larger than the sum of its proper divisors (10125859219).
1200321201133 is a wasteful number, since it uses less digits than its factorization.
1200321201133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15699531.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1200321201133 its reverse (3311021230021), we get a palindrome (4511342431154).
The spelling of 1200321201133 in words is "one trillion, two hundred billion, three hundred twenty-one million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •