Base | Representation |
---|---|
bin | 10001011110101111000… |
… | …001101100010101100101 |
3 | 11020211120221120001212022 |
4 | 101132233001230111211 |
5 | 124140110434112013 |
6 | 2315501041432525 |
7 | 152533441232051 |
oct | 21365701542545 |
9 | 4224527501768 |
10 | 1201232332133 |
11 | 4234923764a9 |
12 | 17498233b745 |
13 | 893779bc812 |
14 | 421d6072c61 |
15 | 213a7eb1008 |
hex | 117af06c565 |
1201232332133 has 4 divisors (see below), whose sum is σ = 1229167967808. Its totient is φ = 1173296696460.
The previous prime is 1201232332073. The next prime is 1201232332163. The reversal of 1201232332133 is 3312332321021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1201232332133 - 222 = 1201228137829 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201232332163) 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, 13967817773 + ... + 13967817858.
It is an arithmetic number, because the mean of its divisors is an integer number (307291991952).
Almost surely, 21201232332133 is an apocalyptic number.
It is an amenable number.
1201232332133 is a deficient number, since it is larger than the sum of its proper divisors (27935635675).
1201232332133 is an equidigital number, since it uses as much as digits as its factorization.
1201232332133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27935635674.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 1201232332133 its reverse (3312332321021), we get a palindrome (4513564653154).
The spelling of 1201232332133 in words is "one trillion, two hundred one billion, two hundred thirty-two million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •