Base | Representation |
---|---|
bin | 10001011101111101011… |
… | …110111010101011001001 |
3 | 11020202110000111201221211 |
4 | 101131331132322223021 |
5 | 124131410142212413 |
6 | 2315242350133121 |
7 | 152504026161532 |
oct | 21357536725311 |
9 | 4222400451854 |
10 | 1200401132233 |
11 | 4230a6165736 |
12 | 17478bab11a1 |
13 | 89274734764 |
14 | 42157905689 |
15 | 2135a02483d |
hex | 1177d7baac9 |
1200401132233 has 4 divisors (see below), whose sum is σ = 1203394651668. Its totient is φ = 1197407612800.
The previous prime is 1200401132171. The next prime is 1200401132267. The reversal of 1200401132233 is 3322311040021.
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 836361462784 + 364039669449 = 914528^2 + 603357^2 .
It is a cyclic number.
It is not a de Polignac number, because 1200401132233 - 221 = 1200399035081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200401133233) 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, 1496759116 + ... + 1496759917.
It is an arithmetic number, because the mean of its divisors is an integer number (300848662917).
Almost surely, 21200401132233 is an apocalyptic number.
It is an amenable number.
1200401132233 is a deficient number, since it is larger than the sum of its proper divisors (2993519435).
1200401132233 is an equidigital number, since it uses as much as digits as its factorization.
1200401132233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2993519434.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1200401132233 its reverse (3322311040021), we get a palindrome (4522712172254).
The spelling of 1200401132233 in words is "one trillion, two hundred billion, four hundred one million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •