Base | Representation |
---|---|
bin | 111010101011101111111… |
… | …110011001001000011101 |
3 | 112021112010011201220020202 |
4 | 322223233332121020131 |
5 | 1012032440042343031 |
6 | 12324333240553245 |
7 | 564232125420056 |
oct | 72535776311035 |
9 | 15245104656222 |
10 | 4032705434141 |
11 | 13152960a338a |
12 | 551694a82825 |
13 | 23338982a827 |
14 | dd280bd372d |
15 | 6ed7738e2cb |
hex | 3aaeff9921d |
4032705434141 has 2 divisors, whose sum is σ = 4032705434142. Its totient is φ = 4032705434140.
The previous prime is 4032705434101. The next prime is 4032705434221. The reversal of 4032705434141 is 1414345072304.
4032705434141 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., 2214129120025 + 1818576314116 = 1487995^2 + 1348546^2 .
It is a cyclic number.
It is not a de Polignac number, because 4032705434141 - 230 = 4031631692317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4032705434095 and 4032705434104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4032705434101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2016352717070 + 2016352717071.
It is an arithmetic number, because the mean of its divisors is an integer number (2016352717071).
Almost surely, 24032705434141 is an apocalyptic number.
It is an amenable number.
4032705434141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4032705434141 is an equidigital number, since it uses as much as digits as its factorization.
4032705434141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 161280, while the sum is 38.
The spelling of 4032705434141 in words is "four trillion, thirty-two billion, seven hundred five million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •