Base | Representation |
---|---|
bin | 10000011101011011011… |
… | …111101100011110001001 |
3 | 11000010121002201101002120 |
4 | 100131123133230132021 |
5 | 122013004011342441 |
6 | 2223343031321453 |
7 | 144501665361054 |
oct | 20353337543611 |
9 | 4003532641076 |
10 | 1131111434121 |
11 | 3a6779a09a19 |
12 | 163272b20289 |
13 | 828814c55a6 |
14 | 3ca63389a9b |
15 | 1e651e6d966 |
hex | 1075b7ec789 |
1131111434121 has 8 divisors (see below), whose sum is σ = 1596863201184. Its totient is φ = 709716978240.
The previous prime is 1131111434113. The next prime is 1131111434191. The reversal of 1131111434121 is 1214341111311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1131111434121 - 23 = 1131111434113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1131111434091 and 1131111434100.
It is not an unprimeable number, because it can be changed into a prime (1131111434191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11089327735 + ... + 11089327836.
It is an arithmetic number, because the mean of its divisors is an integer number (199607900148).
Almost surely, 21131111434121 is an apocalyptic number.
It is an amenable number.
1131111434121 is a deficient number, since it is larger than the sum of its proper divisors (465751767063).
1131111434121 is a wasteful number, since it uses less digits than its factorization.
1131111434121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22178655591.
The product of its digits is 288, while the sum is 24.
Adding to 1131111434121 its reverse (1214341111311), we get a palindrome (2345452545432).
The spelling of 1131111434121 in words is "one trillion, one hundred thirty-one billion, one hundred eleven million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •