Base | Representation |
---|---|
bin | 110010011000001000010101… |
… | …111010111110001110010100 |
3 | 1002001110222111201120120211112 |
4 | 302120020111322332032110 |
5 | 213020022001440242322 |
6 | 2103115302321154152 |
7 | 64445135663461565 |
oct | 6230102572761624 |
9 | 1061428451516745 |
10 | 221560550712212 |
11 | 64661335894a98 |
12 | 20a23b0418b958 |
13 | 96820bb545aba |
14 | 3c9d83319816c |
15 | 1a934720565e2 |
hex | c98215ebe394 |
221560550712212 has 6 divisors (see below), whose sum is σ = 387730963746378. Its totient is φ = 110780275356104.
The previous prime is 221560550712203. The next prime is 221560550712229. The reversal of 221560550712212 is 212217055065122.
It can be written as a sum of positive squares in only one way, i.e., 127369371926416 + 94191178785796 = 11285804^2 + 9705214^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 221560550712212.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27695068839023 + ... + 27695068839030.
It is an arithmetic number, because the mean of its divisors is an integer number (64621827291063).
Almost surely, 2221560550712212 is an apocalyptic number.
It is an amenable number.
221560550712212 is a deficient number, since it is larger than the sum of its proper divisors (166170413034166).
221560550712212 is a wasteful number, since it uses less digits than its factorization.
221560550712212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55390137678057 (or 55390137678055 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 41.
The spelling of 221560550712212 in words is "two hundred twenty-one trillion, five hundred sixty billion, five hundred fifty million, seven hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •