Base | Representation |
---|---|
bin | 110000011100000101… |
… | …0100111101011001001 |
3 | 100221111102211212220101 |
4 | 1200320022213223021 |
5 | 3201014002220040 |
6 | 115441542125401 |
7 | 10341515233531 |
oct | 1407012475311 |
9 | 327442755811 |
10 | 104021523145 |
11 | 4012a48aa51 |
12 | 181b0720861 |
13 | 9a69a28937 |
14 | 506b1b84c1 |
15 | 2a8c31209a |
hex | 18382a7ac9 |
104021523145 has 4 divisors (see below), whose sum is σ = 124825827780. Its totient is φ = 83217218512.
The previous prime is 104021523143. The next prime is 104021523181. The reversal of 104021523145 is 541325120401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 56545035264 + 47476487881 = 237792^2 + 217891^2 .
It is a cyclic number.
It is not a de Polignac number, because 104021523145 - 21 = 104021523143 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104021523143) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 10402152310 + ... + 10402152319.
It is an arithmetic number, because the mean of its divisors is an integer number (31206456945).
Almost surely, 2104021523145 is an apocalyptic number.
It is an amenable number.
104021523145 is a deficient number, since it is larger than the sum of its proper divisors (20804304635).
104021523145 is an equidigital number, since it uses as much as digits as its factorization.
104021523145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20804304634.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 104021523145 its reverse (541325120401), we get a palindrome (645346643546).
The spelling of 104021523145 in words is "one hundred four billion, twenty-one million, five hundred twenty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •