Base | Representation |
---|---|
bin | 10001110011001100011… |
… | …101100101110011001011 |
3 | 11022221021222112002201101 |
4 | 101303030131211303023 |
5 | 130020103430134011 |
6 | 2333533015002231 |
7 | 154242030062035 |
oct | 21631435456313 |
9 | 4287258462641 |
10 | 1223201021131 |
11 | 4318360a6721 |
12 | 179093669377 |
13 | 8b4691cab8b |
14 | 432bb9c2c55 |
15 | 21c419a72c1 |
hex | 11ccc765ccb |
1223201021131 has 8 divisors (see below), whose sum is σ = 1297963475424. Its totient is φ = 1148750728320.
The previous prime is 1223201021113. The next prime is 1223201021137. The reversal of 1223201021131 is 1311201023221.
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 1223201021131 - 239 = 673445207243 is a prime.
It is a super-2 number, since 2×12232010211312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1223201021099 and 1223201021108.
It is not an unprimeable number, because it can be changed into a prime (1223201021137) 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, 78032295 + ... + 78047968.
It is an arithmetic number, because the mean of its divisors is an integer number (162245434428).
Almost surely, 21223201021131 is an apocalyptic number.
1223201021131 is a deficient number, since it is larger than the sum of its proper divisors (74762454293).
1223201021131 is a wasteful number, since it uses less digits than its factorization.
1223201021131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156080741.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1223201021131 its reverse (1311201023221), we get a palindrome (2534402044352).
The spelling of 1223201021131 in words is "one trillion, two hundred twenty-three billion, two hundred one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •