Base | Representation |
---|---|
bin | 10000011101010101100… |
… | …001110010101000000001 |
3 | 11000010100010100001210001 |
4 | 100131111201302220001 |
5 | 122012302344222241 |
6 | 2223325053440001 |
7 | 144466341413101 |
oct | 20352541625001 |
9 | 4003303301701 |
10 | 1131011320321 |
11 | 3a672844aa43 |
12 | 1632454a0001 |
13 | 8286684205c |
14 | 3ca53d69201 |
15 | 1e648295431 |
hex | 10755872a01 |
1131011320321 has 4 divisors (see below), whose sum is σ = 1131013449472. Its totient is φ = 1131009191172.
The previous prime is 1131011320297. The next prime is 1131011320333. The reversal of 1131011320321 is 1230231101311.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1131011320321 - 217 = 1131011189249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131011390321) 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, 460216 + ... + 1572838.
It is an arithmetic number, because the mean of its divisors is an integer number (282753362368).
Almost surely, 21131011320321 is an apocalyptic number.
It is an amenable number.
1131011320321 is a deficient number, since it is larger than the sum of its proper divisors (2129151).
1131011320321 is a wasteful number, since it uses less digits than its factorization.
1131011320321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2129150.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1131011320321 its reverse (1230231101311), we get a palindrome (2361242421632).
The spelling of 1131011320321 in words is "one trillion, one hundred thirty-one billion, eleven million, three hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •