Base | Representation |
---|---|
bin | 101100001110011011011010… |
… | …1000001111111110100000101 |
3 | 1220000101002200010020000012002 |
4 | 1120130312311001333310011 |
5 | 401442024223141201404 |
6 | 3455205123055235045 |
7 | 144640060644641531 |
oct | 13034666501776405 |
9 | 1800332603200162 |
10 | 389011110100229 |
11 | 102a5075a175501 |
12 | 37768b61818a85 |
13 | 1390a789ac0206 |
14 | 6c0c349842bc1 |
15 | 2ee9112010c1e |
hex | 161cdb507fd05 |
389011110100229 has 2 divisors, whose sum is σ = 389011110100230. Its totient is φ = 389011110100228.
The previous prime is 389011110100183. The next prime is 389011110100273. The reversal of 389011110100229 is 922001011110983.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 288842839372129 + 100168270728100 = 16995377^2 + 10008410^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-389011110100229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 389011110100192 and 389011110100201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (389011110100729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 194505555050114 + 194505555050115.
It is an arithmetic number, because the mean of its divisors is an integer number (194505555050115).
Almost surely, 2389011110100229 is an apocalyptic number.
It is an amenable number.
389011110100229 is a deficient number, since it is larger than the sum of its proper divisors (1).
389011110100229 is an equidigital number, since it uses as much as digits as its factorization.
389011110100229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 38.
The spelling of 389011110100229 in words is "three hundred eighty-nine trillion, eleven billion, one hundred ten million, one hundred thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •