Base | Representation |
---|---|
bin | 10111001101101… |
… | …010000100001101 |
3 | 1000010211102101112 |
4 | 113031222010031 |
5 | 1244200044031 |
6 | 102351221405 |
7 | 12436215434 |
oct | 2715520415 |
9 | 1003742345 |
10 | 389456141 |
11 | 18a924188 |
12 | aa517865 |
13 | 628bc329 |
14 | 39a1c11b |
15 | 242ce62b |
hex | 1736a10d |
389456141 has 2 divisors, whose sum is σ = 389456142. Its totient is φ = 389456140.
The previous prime is 389456107. The next prime is 389456149. The reversal of 389456141 is 141654983.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 194742025 + 194714116 = 13955^2 + 13954^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-389456141 is a prime.
It is a super-2 number, since 2×3894561412 = 303352171525223762, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (389456149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 194728070 + 194728071.
It is an arithmetic number, because the mean of its divisors is an integer number (194728071).
Almost surely, 2389456141 is an apocalyptic number.
389456141 is the 13955-th centered square number.
It is an amenable number.
389456141 is a deficient number, since it is larger than the sum of its proper divisors (1).
389456141 is an equidigital number, since it uses as much as digits as its factorization.
389456141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 103680, while the sum is 41.
The square root of 389456141 is about 19734.6431688034. The cubic root of 389456141 is about 730.2745830127.
The spelling of 389456141 in words is "three hundred eighty-nine million, four hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •