Base | Representation |
---|---|
bin | 10001011101100101101… |
… | …101011111110011001101 |
3 | 11020201102020001000112121 |
4 | 101131211231133303031 |
5 | 124130101042114013 |
6 | 2315135021532541 |
7 | 152461114155616 |
oct | 21354555376315 |
9 | 4221366030477 |
10 | 1200002301133 |
11 | 422a11018a59 |
12 | 17469a414151 |
13 | 8920cc1221c |
14 | 4211a966c0d |
15 | 21334ee258d |
hex | 11765b5fccd |
1200002301133 has 4 divisors (see below), whose sum is σ = 1202773669468. Its totient is φ = 1197230932800.
The previous prime is 1200002301073. The next prime is 1200002301149. The reversal of 1200002301133 is 3311032000021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 335098581129 + 864903720004 = 578877^2 + 930002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1200002301133 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 (1200002301833) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1385683518 + ... + 1385684383.
It is an arithmetic number, because the mean of its divisors is an integer number (300693417367).
Almost surely, 21200002301133 is an apocalyptic number.
It is an amenable number.
1200002301133 is a deficient number, since it is larger than the sum of its proper divisors (2771368335).
1200002301133 is an equidigital number, since it uses as much as digits as its factorization.
1200002301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2771368334.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1200002301133 its reverse (3311032000021), we get a palindrome (4511034301154).
The spelling of 1200002301133 in words is "one trillion, two hundred billion, two million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •