Base | Representation |
---|---|
bin | 10001011010000100010… |
… | …001011111011010001101 |
3 | 11020100122122010120121222 |
4 | 101122010101133122031 |
5 | 124044324320222101 |
6 | 2313311431533125 |
7 | 152265306651221 |
oct | 21320421373215 |
9 | 4210578116558 |
10 | 1196220085901 |
11 | 421350064745 |
12 | 173a0382a1a5 |
13 | 88a59463b49 |
14 | 41c7c504781 |
15 | 211b2e3b01b |
hex | 1168445f68d |
1196220085901 has 8 divisors (see below), whose sum is σ = 1196568806400. Its totient is φ = 1195871430880.
The previous prime is 1196220085889. The next prime is 1196220085913. The reversal of 1196220085901 is 1095800226911.
It is an interprime number because it is at equal distance from previous prime (1196220085889) and next prime (1196220085913).
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 1196220085901 - 238 = 921342178957 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 (1196220085301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94399796 + ... + 94412466.
It is an arithmetic number, because the mean of its divisors is an integer number (149571100800).
Almost surely, 21196220085901 is an apocalyptic number.
It is an amenable number.
1196220085901 is a deficient number, since it is larger than the sum of its proper divisors (348720499).
1196220085901 is a wasteful number, since it uses less digits than its factorization.
1196220085901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32739.
The product of its (nonzero) digits is 77760, while the sum is 44.
The spelling of 1196220085901 in words is "one trillion, one hundred ninety-six billion, two hundred twenty million, eighty-five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •