Base | Representation |
---|---|
bin | 110000011100000010… |
… | …1010111010011010101 |
3 | 100221111100020212221111 |
4 | 1200320011113103111 |
5 | 3201013124122430 |
6 | 115441452415021 |
7 | 10341500434633 |
oct | 1407005272325 |
9 | 327440225844 |
10 | 104020145365 |
11 | 40129729894 |
12 | 181b0177471 |
13 | 9a69665796 |
14 | 506ad3a353 |
15 | 2a8c13dc2a |
hex | 18381574d5 |
104020145365 has 8 divisors (see below), whose sum is σ = 124955160408. Its totient is φ = 83128792320.
The previous prime is 104020145357. The next prime is 104020145371. The reversal of 104020145365 is 563541020401.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 29762805361 + 74257340004 = 172519^2 + 272502^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104020145365 - 23 = 104020145357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10910256 + ... + 10919785.
It is an arithmetic number, because the mean of its divisors is an integer number (15619395051).
Almost surely, 2104020145365 is an apocalyptic number.
It is an amenable number.
104020145365 is a deficient number, since it is larger than the sum of its proper divisors (20935015043).
104020145365 is an equidigital number, since it uses as much as digits as its factorization.
104020145365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21830999.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 104020145365 its reverse (563541020401), we get a palindrome (667561165766).
The spelling of 104020145365 in words is "one hundred four billion, twenty million, one hundred forty-five thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •