Base | Representation |
---|---|
bin | 10001011101111001010… |
… | …000110000100101001011 |
3 | 11020202021002020200212122 |
4 | 101131321100300211023 |
5 | 124131234024441021 |
6 | 2315231340201455 |
7 | 152502206210555 |
oct | 21357120604513 |
9 | 4222232220778 |
10 | 1200330312011 |
11 | 42306a194426 |
12 | 17477023928b |
13 | 89262b697bc |
14 | 4214c34c4d5 |
15 | 21353bd5bab |
hex | 1177943094b |
1200330312011 has 4 divisors (see below), whose sum is σ = 1200474747024. Its totient is φ = 1200185877000.
The previous prime is 1200330311951. The next prime is 1200330312037. The reversal of 1200330312011 is 1102130330021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1200330312011 - 210 = 1200330310987 is a prime.
It is a super-2 number, since 2×12003303120112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200330312091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72205040 + ... + 72221661.
It is an arithmetic number, because the mean of its divisors is an integer number (300118686756).
Almost surely, 21200330312011 is an apocalyptic number.
1200330312011 is a deficient number, since it is larger than the sum of its proper divisors (144435013).
1200330312011 is an equidigital number, since it uses as much as digits as its factorization.
1200330312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144435012.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1200330312011 its reverse (1102130330021), we get a palindrome (2302460642032).
The spelling of 1200330312011 in words is "one trillion, two hundred billion, three hundred thirty million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •