Base | Representation |
---|---|
bin | 101100001111110100100001… |
… | …0101011011110000110111001 |
3 | 1220001001101120222110020012101 |
4 | 1120133221002223132012321 |
5 | 402003143122032330242 |
6 | 3455433051045343401 |
7 | 144656643623531554 |
oct | 13037510253360671 |
9 | 1801041528406171 |
10 | 389202465120697 |
11 | 103014925089618 |
12 | 3779a066107b61 |
13 | 13922834082487 |
14 | 6c176dd72569b |
15 | 2eee0b15349b7 |
hex | 161fa42ade1b9 |
389202465120697 has 2 divisors, whose sum is σ = 389202465120698. Its totient is φ = 389202465120696.
The previous prime is 389202465120673. The next prime is 389202465120727. The reversal of 389202465120697 is 796021564202983.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222215697423801 + 166986767696896 = 14906901^2 + 12922336^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-389202465120697 is a prime.
It is not a weakly prime, because it can be changed into another prime (389202465129697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 194601232560348 + 194601232560349.
It is an arithmetic number, because the mean of its divisors is an integer number (194601232560349).
It is a 1-persistent number, because it is pandigital, but 2⋅389202465120697 = 778404930241394 is not.
Almost surely, 2389202465120697 is an apocalyptic number.
It is an amenable number.
389202465120697 is a deficient number, since it is larger than the sum of its proper divisors (1).
389202465120697 is an equidigital number, since it uses as much as digits as its factorization.
389202465120697 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78382080, while the sum is 64.
The spelling of 389202465120697 in words is "three hundred eighty-nine trillion, two hundred two billion, four hundred sixty-five million, one hundred twenty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •