Base | Representation |
---|---|
bin | 11100011010110… |
… | …00110110010001 |
3 | 121121120111112012 |
4 | 32031120312101 |
5 | 442012000143 |
6 | 35353312305 |
7 | 5623200353 |
oct | 1615306621 |
9 | 547514465 |
10 | 238390673 |
11 | 112624494 |
12 | 67a05695 |
13 | 3a509491 |
14 | 239370d3 |
15 | 15dde418 |
hex | e358d91 |
238390673 has 2 divisors, whose sum is σ = 238390674. Its totient is φ = 238390672.
The previous prime is 238390639. The next prime is 238390697. The reversal of 238390673 is 376093832.
238390673 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., 194407249 + 43983424 = 13943^2 + 6632^2 .
It is a cyclic number.
It is not a de Polignac number, because 238390673 - 28 = 238390417 is a prime.
It is a super-2 number, since 2×2383906732 = 113660225946785858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 238390673.
It is not a weakly prime, because it can be changed into another prime (238390073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 119195336 + 119195337.
It is an arithmetic number, because the mean of its divisors is an integer number (119195337).
Almost surely, 2238390673 is an apocalyptic number.
It is an amenable number.
238390673 is a deficient number, since it is larger than the sum of its proper divisors (1).
238390673 is an equidigital number, since it uses as much as digits as its factorization.
238390673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 163296, while the sum is 41.
The square root of 238390673 is about 15439.9052134396. The cubic root of 238390673 is about 620.0543422712.
The spelling of 238390673 in words is "two hundred thirty-eight million, three hundred ninety thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •