Base | Representation |
---|---|
bin | 10011010111101100111… |
… | …111110001001111110111 |
3 | 11201020212010001210110121 |
4 | 103113230333301033313 |
5 | 133302113441043411 |
6 | 2455301503232411 |
7 | 165112264050532 |
oct | 23275477611767 |
9 | 4636763053417 |
10 | 1331121034231 |
11 | 47358613789a |
12 | 195b918a8707 |
13 | 986a77c62b1 |
14 | 485d8849a19 |
15 | 2495b18c571 |
hex | 135ecff13f7 |
1331121034231 has 16 divisors (see below), whose sum is σ = 1376659243008. Its totient is φ = 1285746321600.
The previous prime is 1331121034171. The next prime is 1331121034259. The reversal of 1331121034231 is 1324301211331.
It is a cyclic number.
It is not a de Polignac number, because 1331121034231 - 217 = 1331120903159 is a prime.
It is a super-2 number, since 2×13311210342312 (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 = 1331121034196 and 1331121034205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331121034931) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 127216506 + ... + 127226968.
It is an arithmetic number, because the mean of its divisors is an integer number (86041202688).
Almost surely, 21331121034231 is an apocalyptic number.
1331121034231 is a deficient number, since it is larger than the sum of its proper divisors (45538208777).
1331121034231 is a wasteful number, since it uses less digits than its factorization.
1331121034231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17862.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 1331121034231 its reverse (1324301211331), we get a palindrome (2655422245562).
The spelling of 1331121034231 in words is "one trillion, three hundred thirty-one billion, one hundred twenty-one million, thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •