Base | Representation |
---|---|
bin | 10000011101100001011… |
… | …111110111001100001001 |
3 | 11000010212010012211101212 |
4 | 100131201133313030021 |
5 | 122013210302010241 |
6 | 2223401030022505 |
7 | 144504330360053 |
oct | 20354137671411 |
9 | 4003763184355 |
10 | 1131212141321 |
11 | 3a6820843809 |
12 | 1632a07a7a35 |
13 | 82899325c52 |
14 | 3ca728c28d3 |
15 | 1e65ac12beb |
hex | 107617f7309 |
1131212141321 has 8 divisors (see below), whose sum is σ = 1133917803144. Its totient is φ = 1128509704960.
The previous prime is 1131212141303. The next prime is 1131212141327. The reversal of 1131212141321 is 1231412121311.
It can be written as a sum of positive squares in 4 ways, for example, as 35915935225 + 1095296206096 = 189515^2 + 1046564^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1131212141321 - 230 = 1130138399497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131212141327) 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, 103370 + ... + 1507683.
It is an arithmetic number, because the mean of its divisors is an integer number (141739725393).
Almost surely, 21131212141321 is an apocalyptic number.
It is an amenable number.
1131212141321 is a deficient number, since it is larger than the sum of its proper divisors (2705661823).
1131212141321 is an equidigital number, since it uses as much as digits as its factorization.
1131212141321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1612731.
The product of its digits is 288, while the sum is 23.
Adding to 1131212141321 its reverse (1231412121311), we get a palindrome (2362624262632).
The spelling of 1131212141321 in words is "one trillion, one hundred thirty-one billion, two hundred twelve million, one hundred forty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •