Base | Representation |
---|---|
bin | 10000011101100010000… |
… | …010011101110010001110 |
3 | 11000010212202021200110010 |
4 | 100131202002131302032 |
5 | 122013220112243202 |
6 | 2223401552254050 |
7 | 144504500440056 |
oct | 20354202356216 |
9 | 4003782250403 |
10 | 1131221212302 |
11 | 3a6825979995 |
12 | 1632a3841326 |
13 | 8289b1809ac |
14 | 3ca73ba4566 |
15 | 1e65b90576c |
hex | 1076209dc8e |
1131221212302 has 8 divisors (see below), whose sum is σ = 2262442424616. Its totient is φ = 377073737432.
The previous prime is 1131221212237. The next prime is 1131221212313. The reversal of 1131221212302 is 2032121221311.
It is a sphenic number, since it is the product of 3 distinct primes.
1131221212302 is an admirable number.
It is a super-2 number, since 2×11312212123022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94268434353 + ... + 94268434364.
It is an arithmetic number, because the mean of its divisors is an integer number (282805303077).
Almost surely, 21131221212302 is an apocalyptic number.
1131221212302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131221212302 is a wasteful number, since it uses less digits than its factorization.
1131221212302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188536868722.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1131221212302 its reverse (2032121221311), we get a palindrome (3163342433613).
Subtracting 1131221212302 from its reverse (2032121221311), we obtain a palindrome (900900009009).
The spelling of 1131221212302 in words is "one trillion, one hundred thirty-one billion, two hundred twenty-one million, two hundred twelve thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •