Base | Representation |
---|---|
bin | 110000011100010110… |
… | …0100110100001100101 |
3 | 100221112001121110122021 |
4 | 1200320230212201211 |
5 | 3201023242300313 |
6 | 115442501103141 |
7 | 10341654035113 |
oct | 1407054464145 |
9 | 327461543567 |
10 | 104030431333 |
11 | 40134514894 |
12 | 181b36b7ab1 |
13 | 9a6b82755a |
14 | 506c456ab3 |
15 | 2a8cec178d |
hex | 1838b26865 |
104030431333 has 2 divisors, whose sum is σ = 104030431334. Its totient is φ = 104030431332.
The previous prime is 104030431303. The next prime is 104030431361. The reversal of 104030431333 is 333134030401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101150713764 + 2879717569 = 318042^2 + 53663^2 .
It is an emirp because it is prime and its reverse (333134030401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104030431333 - 213 = 104030423141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104030431298 and 104030431307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104030431303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52015215666 + 52015215667.
It is an arithmetic number, because the mean of its divisors is an integer number (52015215667).
Almost surely, 2104030431333 is an apocalyptic number.
It is an amenable number.
104030431333 is a deficient number, since it is larger than the sum of its proper divisors (1).
104030431333 is an equidigital number, since it uses as much as digits as its factorization.
104030431333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 104030431333 its reverse (333134030401), we get a palindrome (437164461734).
The spelling of 104030431333 in words is "one hundred four billion, thirty million, four hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •