Base | Representation |
---|---|
bin | 1000100011110110110… |
… | …10101010100111010101 |
3 | 1001010012022102000100201 |
4 | 10101323122222213111 |
5 | 14304333330121424 |
6 | 343042023340501 |
7 | 30151526562115 |
oct | 4217332524725 |
9 | 1033168360321 |
10 | 294128363989 |
11 | 103814880259 |
12 | 49006bb1731 |
13 | 21975527a85 |
14 | 103433c9045 |
15 | 79b6e7ed44 |
hex | 447b6aa9d5 |
294128363989 has 2 divisors, whose sum is σ = 294128363990. Its totient is φ = 294128363988.
The previous prime is 294128363987. The next prime is 294128363993. The reversal of 294128363989 is 989363821492.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 283644651889 + 10483712100 = 532583^2 + 102390^2 .
It is a cyclic number.
It is not a de Polignac number, because 294128363989 - 21 = 294128363987 is a prime.
It is a super-2 number, since 2×2941283639892 (a number of 24 digits) contains 22 as substring.
Together with 294128363987, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 294128363989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (294128363987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 147064181994 + 147064181995.
It is an arithmetic number, because the mean of its divisors is an integer number (147064181995).
Almost surely, 2294128363989 is an apocalyptic number.
It is an amenable number.
294128363989 is a deficient number, since it is larger than the sum of its proper divisors (1).
294128363989 is an equidigital number, since it uses as much as digits as its factorization.
294128363989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40310784, while the sum is 64.
The spelling of 294128363989 in words is "two hundred ninety-four billion, one hundred twenty-eight million, three hundred sixty-three thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •