Base | Representation |
---|---|
bin | 1001010001101… |
… | …0011001101101 |
3 | 2201012121020201 |
4 | 2110122121231 |
5 | 34424433303 |
6 | 3505513501 |
7 | 651455656 |
oct | 224323155 |
9 | 81177221 |
10 | 38905453 |
11 | 1aa63274 |
12 | 11042891 |
13 | 80a25a2 |
14 | 524a52d |
15 | 363781d |
hex | 251a66d |
38905453 has 2 divisors, whose sum is σ = 38905454. Its totient is φ = 38905452.
The previous prime is 38905417. The next prime is 38905459. The reversal of 38905453 is 35450983.
38905453 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., 32285124 + 6620329 = 5682^2 + 2573^2 .
It is an emirp because it is prime and its reverse (35450983) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 38905453 - 217 = 38774381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38905459) 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, 19452726 + 19452727.
It is an arithmetic number, because the mean of its divisors is an integer number (19452727).
Almost surely, 238905453 is an apocalyptic number.
It is an amenable number.
38905453 is a deficient number, since it is larger than the sum of its proper divisors (1).
38905453 is an equidigital number, since it uses as much as digits as its factorization.
38905453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
The square root of 38905453 is about 6237.4235867063. The cubic root of 38905453 is about 338.8468807834.
The spelling of 38905453 in words is "thirty-eight million, nine hundred five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •