Base | Representation |
---|---|
bin | 111000000111001… |
… | …111000110001101 |
3 | 2102121110010202021 |
4 | 320013033012031 |
5 | 3412000432231 |
6 | 233225530141 |
7 | 32220642316 |
oct | 7007170615 |
9 | 2377403667 |
10 | 941420941 |
11 | 44345353a |
12 | 223343951 |
13 | 120069c16 |
14 | 8d05d60d |
15 | 579ae811 |
hex | 381cf18d |
941420941 has 2 divisors, whose sum is σ = 941420942. Its totient is φ = 941420940.
The previous prime is 941420929. The next prime is 941420957. The reversal of 941420941 is 149024149.
941420941 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., 476156041 + 465264900 = 21821^2 + 21570^2 .
It is an emirp because it is prime and its reverse (149024149) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 941420941 - 27 = 941420813 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 941420897 and 941420906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (941420971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 470710470 + 470710471.
It is an arithmetic number, because the mean of its divisors is an integer number (470710471).
Almost surely, 2941420941 is an apocalyptic number.
It is an amenable number.
941420941 is a deficient number, since it is larger than the sum of its proper divisors (1).
941420941 is an equidigital number, since it uses as much as digits as its factorization.
941420941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 34.
The square root of 941420941 is about 30682.5836754339. The cubic root of 941420941 is about 980.0794538524.
The spelling of 941420941 in words is "nine hundred forty-one million, four hundred twenty thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •