Base | Representation |
---|---|
bin | 10001011111011100111… |
… | …010111011100010100011 |
3 | 11020220120121102001202101 |
4 | 101133130322323202203 |
5 | 124143200042430311 |
6 | 2320105305031231 |
7 | 152561511032263 |
oct | 21373472734243 |
9 | 4226517361671 |
10 | 1202002311331 |
11 | 423847a72248 |
12 | 174b58185517 |
13 | 8946b391103 |
14 | 4226a4257a3 |
15 | 214008a7ec1 |
hex | 117dcebb8a3 |
1202002311331 has 8 divisors (see below), whose sum is σ = 1206897083280. Its totient is φ = 1197112930272.
The previous prime is 1202002311319. The next prime is 1202002311401. The reversal of 1202002311331 is 1331132002021.
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 1202002311331 - 29 = 1202002310819 is a prime.
It is a super-2 number, since 2×12020023113312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1202002311299 and 1202002311308.
It is not an unprimeable number, because it can be changed into a prime (1202032311331) 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, 900576 + ... + 1793053.
It is an arithmetic number, because the mean of its divisors is an integer number (150862135410).
Almost surely, 21202002311331 is an apocalyptic number.
1202002311331 is a deficient number, since it is larger than the sum of its proper divisors (4894771949).
1202002311331 is a wasteful number, since it uses less digits than its factorization.
1202002311331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2695445.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1202002311331 its reverse (1331132002021), we get a palindrome (2533134313352).
The spelling of 1202002311331 in words is "one trillion, two hundred two billion, two million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •