Base | Representation |
---|---|
bin | 10000010100001000000… |
… | …010111010000010101101 |
3 | 10222011210212210021221221 |
4 | 100110020002322002231 |
5 | 121332024042202023 |
6 | 2215011443223341 |
7 | 143666302016344 |
oct | 20241002720255 |
9 | 3864725707857 |
10 | 1121121444013 |
11 | 3a251291154a |
12 | 161345377b51 |
13 | 8194b90133c |
14 | 3c3966b0b5b |
15 | 1e269ddb85d |
hex | 105080ba0ad |
1121121444013 has 4 divisors (see below), whose sum is σ = 1121124755068. Its totient is φ = 1121118132960.
The previous prime is 1121121443971. The next prime is 1121121444043. The reversal of 1121121444013 is 3104441211211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 187188618409 + 933932825604 = 432653^2 + 966402^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121121444013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121121444043) 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, 1081218 + ... + 1846963.
It is an arithmetic number, because the mean of its divisors is an integer number (280281188767).
Almost surely, 21121121444013 is an apocalyptic number.
It is an amenable number.
1121121444013 is a deficient number, since it is larger than the sum of its proper divisors (3311055).
1121121444013 is an equidigital number, since it uses as much as digits as its factorization.
1121121444013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3311054.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1121121444013 its reverse (3104441211211), we get a palindrome (4225562655224).
The spelling of 1121121444013 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-one million, four hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •