Base | Representation |
---|---|
bin | 11010010111010… |
… | …00111011010111 |
3 | 120102010211200002 |
4 | 31023220323113 |
5 | 423103430111 |
6 | 33540041515 |
7 | 5323533566 |
oct | 1513507327 |
9 | 512124602 |
10 | 221155031 |
11 | 103922059 |
12 | 6209329b |
13 | 36a83386 |
14 | 2152bbdd |
15 | 1463763b |
hex | d2e8ed7 |
221155031 has 8 divisors (see below), whose sum is σ = 228393984. Its totient is φ = 213982560.
The previous prime is 221155027. The next prime is 221155043. The reversal of 221155031 is 130551122.
It is a happy number.
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 221155031 - 22 = 221155027 is a prime.
It is a super-2 number, since 2×2211550312 = 97819095473221922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221154994 and 221155012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221155331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9815 + ... + 23208.
It is an arithmetic number, because the mean of its divisors is an integer number (28549248).
Almost surely, 2221155031 is an apocalyptic number.
221155031 is a deficient number, since it is larger than the sum of its proper divisors (7238953).
221155031 is a wasteful number, since it uses less digits than its factorization.
221155031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33241.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 221155031 is about 14871.2820899881. The cubic root of 221155031 is about 604.7357004148.
The spelling of 221155031 in words is "two hundred twenty-one million, one hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •