Base | Representation |
---|---|
bin | 11011100000110001110… |
… | …000000110110010101101 |
3 | 20200202000120122121110212 |
4 | 123200301300012302231 |
5 | 221433442244221212 |
6 | 4004312230312205 |
7 | 253410222301505 |
oct | 33406160066255 |
9 | 6622016577425 |
10 | 1890620304557 |
11 | 669897967776 |
12 | 2664b8ab8665 |
13 | 109391721caa |
14 | 67713c1aa05 |
15 | 342a55b3e22 |
hex | 1b831c06cad |
1890620304557 has 2 divisors, whose sum is σ = 1890620304558. Its totient is φ = 1890620304556.
The previous prime is 1890620304539. The next prime is 1890620304583. The reversal of 1890620304557 is 7554030260981.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1255612132681 + 635008171876 = 1120541^2 + 796874^2 .
It is a cyclic number.
It is not a de Polignac number, because 1890620304557 - 26 = 1890620304493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1890620304527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 945310152278 + 945310152279.
It is an arithmetic number, because the mean of its divisors is an integer number (945310152279).
It is a 1-persistent number, because it is pandigital, but 2⋅1890620304557 = 3781240609114 is not.
Almost surely, 21890620304557 is an apocalyptic number.
It is an amenable number.
1890620304557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1890620304557 is an equidigital number, since it uses as much as digits as its factorization.
1890620304557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 1890620304557 in words is "one trillion, eight hundred ninety billion, six hundred twenty million, three hundred four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •