Base | Representation |
---|---|
bin | 10000011101100111100… |
… | …000101100000011001011 |
3 | 11000011010011001001111010 |
4 | 100131213200230003023 |
5 | 122013412113134011 |
6 | 2223415032135003 |
7 | 144506664005226 |
oct | 20354740540313 |
9 | 4004104031433 |
10 | 1131313021131 |
11 | 3a6872786257 |
12 | 16330a537463 |
13 | 828b41b7047 |
14 | 3ca820625bd |
15 | 1e6649dd1a6 |
hex | 1076782c0cb |
1131313021131 has 8 divisors (see below), whose sum is σ = 1527511252480. Its totient is φ = 744661735272.
The previous prime is 1131313021093. The next prime is 1131313021147. The reversal of 1131313021131 is 1311203131311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1131313021131 - 210 = 1131313020107 is a prime.
It is a super-2 number, since 2×11313130211312 (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 = 1131313021098 and 1131313021107.
It is not an unprimeable number, because it can be changed into a prime (1131313021031) 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, 2386736095 + ... + 2386736568.
It is an arithmetic number, because the mean of its divisors is an integer number (190938906560).
Almost surely, 21131313021131 is an apocalyptic number.
1131313021131 is a deficient number, since it is larger than the sum of its proper divisors (396198231349).
1131313021131 is an equidigital number, since it uses as much as digits as its factorization.
1131313021131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4773472745.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 1131313021131 its reverse (1311203131311), we get a palindrome (2442516152442).
The spelling of 1131313021131 in words is "one trillion, one hundred thirty-one billion, three hundred thirteen million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.277 sec. • engine limits •