Base | Representation |
---|---|
bin | 10111101110101… |
… | …011000110000111 |
3 | 1000202010010202222 |
4 | 113232223012013 |
5 | 1303404023421 |
6 | 103300522555 |
7 | 12602613536 |
oct | 2756530607 |
9 | 1022103688 |
10 | 398111111 |
11 | 1947a5852 |
12 | b13b045b |
13 | 6462c908 |
14 | 3ac3231d |
15 | 24e3dcab |
hex | 17bab187 |
398111111 has 2 divisors, whose sum is σ = 398111112. Its totient is φ = 398111110.
The previous prime is 398111081. The next prime is 398111141. The reversal of 398111111 is 111111893.
It is a balanced prime because it is at equal distance from previous prime (398111081) and next prime (398111141).
It is a cyclic number.
It is not a de Polignac number, because 398111111 - 214 = 398094727 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
398111111 is a modest number, since divided by 11111 gives 3981 as remainder.
It is equal to p21240872 and since 398111111 and 21240872 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (398111141) 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, 199055555 + 199055556.
It is an arithmetic number, because the mean of its divisors is an integer number (199055556).
Almost surely, 2398111111 is an apocalyptic number.
398111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
398111111 is an equidigital number, since it uses as much as digits as its factorization.
398111111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216, while the sum is 26.
The square root of 398111111 is about 19952.7218945186. The cubic root of 398111111 is about 735.6446815694.
The spelling of 398111111 in words is "three hundred ninety-eight million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •