Base | Representation |
---|---|
bin | 11101011111001101100… |
… | …10000110110010000101 |
3 | 10120212012220020200012110 |
4 | 32233212302012302011 |
5 | 113100002414143341 |
6 | 2053241441011233 |
7 | 133125526116030 |
oct | 16574662066205 |
9 | 3525186220173 |
10 | 1013189209221 |
11 | 360766993002 |
12 | 144443023b19 |
13 | 7470a917057 |
14 | 37077d86017 |
15 | 1b54e5e0216 |
hex | ebe6c86c85 |
1013189209221 has 8 divisors (see below), whose sum is σ = 1543907366464. Its totient is φ = 578965262400.
The previous prime is 1013189209159. The next prime is 1013189209237. The reversal of 1013189209221 is 1229029813101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1013189209221 - 213 = 1013189201029 is a prime.
It is a super-2 number, since 2×10131892092212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1013189209221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013189609221) 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, 24123552580 + ... + 24123552621.
It is an arithmetic number, because the mean of its divisors is an integer number (192988420808).
Almost surely, 21013189209221 is an apocalyptic number.
It is an amenable number.
1013189209221 is a deficient number, since it is larger than the sum of its proper divisors (530718157243).
1013189209221 is an equidigital number, since it uses as much as digits as its factorization.
1013189209221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48247105211.
The product of its (nonzero) digits is 15552, while the sum is 39.
The spelling of 1013189209221 in words is "one trillion, thirteen billion, one hundred eighty-nine million, two hundred nine thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •