Base | Representation |
---|---|
bin | 10000010100010011111… |
… | …100001111011011101101 |
3 | 10222012022210022222011011 |
4 | 100110103330033123231 |
5 | 121332431140220323 |
6 | 2215043333025221 |
7 | 144004244302036 |
oct | 20242374173355 |
9 | 3865283288134 |
10 | 1121321023213 |
11 | 3a2605537336 |
12 | 1613a0185211 |
13 | 8198106bc41 |
14 | 3c3b4dc3a8d |
15 | 1e27c6b120d |
hex | 10513f0f6ed |
1121321023213 has 8 divisors (see below), whose sum is σ = 1187294431032. Its totient is φ = 1055349098496.
The previous prime is 1121321023201. The next prime is 1121321023223. The reversal of 1121321023213 is 3123201231211.
It can be written as a sum of positive squares in 4 ways, for example, as 426235319689 + 695085703524 = 652867^2 + 833718^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 1121321023213 - 237 = 983882069741 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 (1121321023223) 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, 1437981 + ... + 2076157.
It is an arithmetic number, because the mean of its divisors is an integer number (148411803879).
Almost surely, 21121321023213 is an apocalyptic number.
It is an amenable number.
1121321023213 is a deficient number, since it is larger than the sum of its proper divisors (65973407819).
1121321023213 is a wasteful number, since it uses less digits than its factorization.
1121321023213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 741551.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1121321023213 its reverse (3123201231211), we get a palindrome (4244522254424).
The spelling of 1121321023213 in words is "one trillion, one hundred twenty-one billion, three hundred twenty-one million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •