Base | Representation |
---|---|
bin | 1001010001110101111100… |
… | …0001000100100100011001 |
3 | 1100010022111210000120202111 |
4 | 2110131133001010210121 |
5 | 2314122441202210002 |
6 | 33410444333432321 |
7 | 2102036401310341 |
oct | 224353701044431 |
9 | 40108453016674 |
10 | 10202141444377 |
11 | 3283781970063 |
12 | 11892b063b6a1 |
13 | 59009a01663c |
14 | 273b017a7d21 |
15 | 12a5ab3b93d7 |
hex | 9475f044919 |
10202141444377 has 2 divisors, whose sum is σ = 10202141444378. Its totient is φ = 10202141444376.
The previous prime is 10202141444353. The next prime is 10202141444449. The reversal of 10202141444377 is 77344414120201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10201917073936 + 224370441 = 3194044^2 + 14979^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202141444377 - 223 = 10202133055769 is a prime.
It is not a weakly prime, because it can be changed into another prime (10202141444477) 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, 5101070722188 + 5101070722189.
It is an arithmetic number, because the mean of its divisors is an integer number (5101070722189).
Almost surely, 210202141444377 is an apocalyptic number.
It is an amenable number.
10202141444377 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202141444377 is an equidigital number, since it uses as much as digits as its factorization.
10202141444377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150528, while the sum is 40.
Adding to 10202141444377 its reverse (77344414120201), we get a palindrome (87546555564578).
The spelling of 10202141444377 in words is "ten trillion, two hundred two billion, one hundred forty-one million, four hundred forty-four thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •