Base | Representation |
---|---|
bin | 1001010010011… |
… | …0101110100101 |
3 | 2201022011111122 |
4 | 2110212232211 |
5 | 34433042231 |
6 | 3510543325 |
7 | 652056113 |
oct | 224465645 |
9 | 81264448 |
10 | 38955941 |
11 | 1aa981a2 |
12 | 11067b45 |
13 | 80bc56b |
14 | 5260ab3 |
15 | 364777b |
hex | 2526ba5 |
38955941 has 2 divisors, whose sum is σ = 38955942. Its totient is φ = 38955940.
The previous prime is 38955929. The next prime is 38955971. The reversal of 38955941 is 14955983.
It is a happy number.
38955941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32433025 + 6522916 = 5695^2 + 2554^2 .
It is a cyclic number.
It is not a de Polignac number, because 38955941 - 222 = 34761637 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 38955892 and 38955901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38955911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19477970 + 19477971.
It is an arithmetic number, because the mean of its divisors is an integer number (19477971).
Almost surely, 238955941 is an apocalyptic number.
It is an amenable number.
38955941 is a deficient number, since it is larger than the sum of its proper divisors (1).
38955941 is an equidigital number, since it uses as much as digits as its factorization.
38955941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 194400, while the sum is 44.
The square root of 38955941 is about 6241.4694583888. The cubic root of 38955941 is about 338.9933924336.
The spelling of 38955941 in words is "thirty-eight million, nine hundred fifty-five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •