Base | Representation |
---|---|
bin | 111100010000101000001… |
… | …101010001011001000101 |
3 | 112122212201000102110020012 |
4 | 330100220031101121011 |
5 | 1020321303344303333 |
6 | 12450205411120005 |
7 | 605115261036401 |
oct | 74205015213105 |
9 | 15585630373205 |
10 | 4141023041093 |
11 | 135721a606714 |
12 | 56a6842a3005 |
13 | 24065c604293 |
14 | 1045d8796101 |
15 | 72ab690ee48 |
hex | 3c428351645 |
4141023041093 has 2 divisors, whose sum is σ = 4141023041094. Its totient is φ = 4141023041092.
The previous prime is 4141023041059. The next prime is 4141023041209. The reversal of 4141023041093 is 3901403201414.
4141023041093 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2672365059169 + 1468657981924 = 1634737^2 + 1211882^2 .
It is a cyclic number.
It is not a de Polignac number, because 4141023041093 - 234 = 4123843171909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4141023041893) 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 as a sum of consecutive naturals, namely, 2070511520546 + 2070511520547.
It is an arithmetic number, because the mean of its divisors is an integer number (2070511520547).
Almost surely, 24141023041093 is an apocalyptic number.
It is an amenable number.
4141023041093 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141023041093 is an equidigital number, since it uses as much as digits as its factorization.
4141023041093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 4141023041093 in words is "four trillion, one hundred forty-one billion, twenty-three million, forty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •