Base | Representation |
---|---|
bin | 1001010001111110100000… |
… | …0110100001001110100001 |
3 | 1100010112110001200221121222 |
4 | 2110133220012201032201 |
5 | 2314142143441213243 |
6 | 33411504452424425 |
7 | 2102150366222564 |
oct | 224375006411641 |
9 | 40115401627558 |
10 | 10204441351073 |
11 | 3284752127aa2 |
12 | 1189832918115 |
13 | 590375658188 |
14 | 273c7d0104db |
15 | 12a69326d168 |
hex | 947e81a13a1 |
10204441351073 has 2 divisors, whose sum is σ = 10204441351074. Its totient is φ = 10204441351072.
The previous prime is 10204441351033. The next prime is 10204441351147. The reversal of 10204441351073 is 37015314440201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6307792987024 + 3896648364049 = 2511532^2 + 1973993^2 .
It is a cyclic number.
It is not a de Polignac number, because 10204441351073 - 26 = 10204441351009 is a prime.
It is not a weakly prime, because it can be changed into another prime (10204441351033) 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, 5102220675536 + 5102220675537.
It is an arithmetic number, because the mean of its divisors is an integer number (5102220675537).
Almost surely, 210204441351073 is an apocalyptic number.
It is an amenable number.
10204441351073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204441351073 is an equidigital number, since it uses as much as digits as its factorization.
10204441351073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 35.
Adding to 10204441351073 its reverse (37015314440201), we get a palindrome (47219755791274).
The spelling of 10204441351073 in words is "ten trillion, two hundred four billion, four hundred forty-one million, three hundred fifty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •