Base | Representation |
---|---|
bin | 10011000110111… |
… | …11110110000101 |
3 | 102011122002211122 |
4 | 21203133312011 |
5 | 312014103141 |
6 | 23523443325 |
7 | 3654350111 |
oct | 1143376605 |
9 | 364562748 |
10 | 160300421 |
11 | 82538096 |
12 | 45826545 |
13 | 27297428 |
14 | 1740a741 |
15 | e11664b |
hex | 98dfd85 |
160300421 has 2 divisors, whose sum is σ = 160300422. Its totient is φ = 160300420.
The previous prime is 160300417. The next prime is 160300423. The reversal of 160300421 is 124003061.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138909796 + 21390625 = 11786^2 + 4625^2 .
It is a cyclic number.
It is not a de Polignac number, because 160300421 - 22 = 160300417 is a prime.
It is a Sophie Germain prime.
Together with 160300423, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 160300421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (160300423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80150210 + 80150211.
It is an arithmetic number, because the mean of its divisors is an integer number (80150211).
Almost surely, 2160300421 is an apocalyptic number.
It is an amenable number.
160300421 is a deficient number, since it is larger than the sum of its proper divisors (1).
160300421 is an equidigital number, since it uses as much as digits as its factorization.
160300421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 160300421 is about 12660.9802543089. The cubic root of 160300421 is about 543.2230892372.
Adding to 160300421 its reverse (124003061), we get a palindrome (284303482).
The spelling of 160300421 in words is "one hundred sixty million, three hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •