Base | Representation |
---|---|
bin | 11010010101110… |
… | …11110110001101 |
3 | 120101210110101012 |
4 | 31022323312031 |
5 | 423032023011 |
6 | 33532055005 |
7 | 5322134342 |
oct | 1512736615 |
9 | 511713335 |
10 | 220970381 |
11 | 103806355 |
12 | 62004465 |
13 | 36a1a308 |
14 | 214c07c9 |
15 | 145eca8b |
hex | d2bbd8d |
220970381 has 2 divisors, whose sum is σ = 220970382. Its totient is φ = 220970380.
The previous prime is 220970363. The next prime is 220970413. The reversal of 220970381 is 183079022.
It is an a-pointer prime, because the next prime (220970413) can be obtained adding 220970381 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128618281 + 92352100 = 11341^2 + 9610^2 .
It is a cyclic number.
It is not a de Polignac number, because 220970381 - 226 = 153861517 is a prime.
It is a super-2 number, since 2×2209703812 = 97655818558570322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220970341) 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, 110485190 + 110485191.
It is an arithmetic number, because the mean of its divisors is an integer number (110485191).
Almost surely, 2220970381 is an apocalyptic number.
It is an amenable number.
220970381 is a deficient number, since it is larger than the sum of its proper divisors (1).
220970381 is an equidigital number, since it uses as much as digits as its factorization.
220970381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 220970381 is about 14865.0725191638. The cubic root of 220970381 is about 604.5673486203.
The spelling of 220970381 in words is "two hundred twenty million, nine hundred seventy thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •