Base | Representation |
---|---|
bin | 10001011110101000011… |
… | …001111000100011101101 |
3 | 11020211022012111122200112 |
4 | 101132220121320203231 |
5 | 124134344013430013 |
6 | 2315442032305405 |
7 | 152530622012213 |
oct | 21365031704355 |
9 | 4224265448615 |
10 | 1201121233133 |
11 | 423435694148 |
12 | 1749510a2265 |
13 | 8935a991173 |
14 | 421c53d2cb3 |
15 | 2139d367ba8 |
hex | 117a86788ed |
1201121233133 has 8 divisors (see below), whose sum is σ = 1265478232800. Its totient is φ = 1136878242768.
The previous prime is 1201121233129. The next prime is 1201121233183. The reversal of 1201121233133 is 3313321211021.
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 1201121233133 - 22 = 1201121233129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201121233099 and 1201121233108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201121233183) 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, 28480691 + ... + 28522832.
It is an arithmetic number, because the mean of its divisors is an integer number (158184779100).
Almost surely, 21201121233133 is an apocalyptic number.
It is an amenable number.
1201121233133 is a deficient number, since it is larger than the sum of its proper divisors (64356999667).
1201121233133 is a wasteful number, since it uses less digits than its factorization.
1201121233133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57004651.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1201121233133 its reverse (3313321211021), we get a palindrome (4514442444154).
The spelling of 1201121233133 in words is "one trillion, two hundred one billion, one hundred twenty-one million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •