Base | Representation |
---|---|
bin | 11110010011001101… |
… | …01000101000101101 |
3 | 1112222200200221011221 |
4 | 33021212220220231 |
5 | 231303404001341 |
6 | 11250103343341 |
7 | 1114055226325 |
oct | 171146505055 |
9 | 45880627157 |
10 | 16267250221 |
11 | 6998490952 |
12 | 319ba51b51 |
13 | 16c3258561 |
14 | b0465c285 |
15 | 6531d5ed1 |
hex | 3c99a8a2d |
16267250221 has 2 divisors, whose sum is σ = 16267250222. Its totient is φ = 16267250220.
The previous prime is 16267250191. The next prime is 16267250231. The reversal of 16267250221 is 12205276261.
16267250221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11829825225 + 4437424996 = 108765^2 + 66614^2 .
It is an emirp because it is prime and its reverse (12205276261) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16267250221 - 25 = 16267250189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16267250231) 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 as a sum of consecutive naturals, namely, 8133625110 + 8133625111.
It is an arithmetic number, because the mean of its divisors is an integer number (8133625111).
Almost surely, 216267250221 is an apocalyptic number.
It is an amenable number.
16267250221 is a deficient number, since it is larger than the sum of its proper divisors (1).
16267250221 is an equidigital number, since it uses as much as digits as its factorization.
16267250221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 34.
The spelling of 16267250221 in words is "sixteen billion, two hundred sixty-seven million, two hundred fifty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •