Base | Representation |
---|---|
bin | 10111101111010000010110… |
… | …101010101001110011100001 |
3 | 111200122202221220212021120012 |
4 | 113233100112222221303201 |
5 | 102141012201444424301 |
6 | 1010013453220254305 |
7 | 30663553630641512 |
oct | 2757202652516341 |
9 | 450582856767505 |
10 | 104402445311201 |
11 | 302a1912680694 |
12 | b861a87841395 |
13 | 46341540717cb |
14 | 1bad168daaa09 |
15 | c10b31b99ebb |
hex | 5ef416aa9ce1 |
104402445311201 has 2 divisors, whose sum is σ = 104402445311202. Its totient is φ = 104402445311200.
The previous prime is 104402445311189. The next prime is 104402445311209. The reversal of 104402445311201 is 102113544204401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52276139090176 + 52126306221025 = 7230224^2 + 7219855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104402445311201 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (104402445311209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52201222655600 + 52201222655601.
It is an arithmetic number, because the mean of its divisors is an integer number (52201222655601).
Almost surely, 2104402445311201 is an apocalyptic number.
It is an amenable number.
104402445311201 is a deficient number, since it is larger than the sum of its proper divisors (1).
104402445311201 is an equidigital number, since it uses as much as digits as its factorization.
104402445311201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 104402445311201 its reverse (102113544204401), we get a palindrome (206515989515602).
The spelling of 104402445311201 in words is "one hundred four trillion, four hundred two billion, four hundred forty-five million, three hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •