Base | Representation |
---|---|
bin | 110000011110100110… |
… | …0111011111010100101 |
3 | 100221201022211120212222 |
4 | 1200331030323322211 |
5 | 3201202120011141 |
6 | 115454201122125 |
7 | 10343562352601 |
oct | 1407514737245 |
9 | 327638746788 |
10 | 104106016421 |
11 | 40173150000 |
12 | 18214a89345 |
13 | 9a813a0264 |
14 | 50784d0501 |
15 | 2a9495214b |
hex | 183d33bea5 |
104106016421 has 10 divisors (see below), whose sum is σ = 114515923110. Its totient is φ = 94641819800.
The previous prime is 104106016411. The next prime is 104106016501. The reversal of 104106016421 is 124610601401.
It can be written as a sum of positive squares in only one way, i.e., 104061727396 + 44289025 = 322586^2 + 6655^2 .
It is a de Polignac number, because none of the positive numbers 2k-104106016421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104106016411) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3540650 + ... + 3569931.
It is an arithmetic number, because the mean of its divisors is an integer number (11451592311).
Almost surely, 2104106016421 is an apocalyptic number.
104106016421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104106016421 is a deficient number, since it is larger than the sum of its proper divisors (10409906689).
104106016421 is an frugal number, since it uses more digits than its factorization.
104106016421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7110625 (or 7110592 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 104106016421 its reverse (124610601401), we get a palindrome (228716617822).
The spelling of 104106016421 in words is "one hundred four billion, one hundred six million, sixteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •