Base | Representation |
---|---|
bin | 111011101110010110001… |
… | …010101010000111111101 |
3 | 112112100200200002221022111 |
4 | 323232112022222013331 |
5 | 1014220412031102221 |
6 | 12421241031214021 |
7 | 602343141055342 |
oct | 73562612520775 |
9 | 15470620087274 |
10 | 4104213144061 |
11 | 1342650361208 |
12 | 563510817311 |
13 | 23a044436814 |
14 | 102905b587c9 |
15 | 71b6001dbe1 |
hex | 3bb962aa1fd |
4104213144061 has 2 divisors, whose sum is σ = 4104213144062. Its totient is φ = 4104213144060.
The previous prime is 4104213144041. The next prime is 4104213144067. The reversal of 4104213144061 is 1604413124014.
4104213144061 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2643453256900 + 1460759887161 = 1625870^2 + 1208619^2 .
It is a cyclic number.
It is not a de Polignac number, because 4104213144061 - 235 = 4069853405693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4104213144067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2052106572030 + 2052106572031.
It is an arithmetic number, because the mean of its divisors is an integer number (2052106572031).
Almost surely, 24104213144061 is an apocalyptic number.
It is an amenable number.
4104213144061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4104213144061 is an equidigital number, since it uses as much as digits as its factorization.
4104213144061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 4104213144061 its reverse (1604413124014), we get a palindrome (5708626268075).
The spelling of 4104213144061 in words is "four trillion, one hundred four billion, two hundred thirteen million, one hundred forty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •