Base | Representation |
---|---|
bin | 111011101011011010011… |
… | …000110011110011110101 |
3 | 112112001120010001200110201 |
4 | 323223122120303303311 |
5 | 1014142434030042031 |
6 | 12420000251120501 |
7 | 602202105046456 |
oct | 73533230636365 |
9 | 15461503050421 |
10 | 4101062737141 |
11 | 1341284000927 |
12 | 562991743131 |
13 | 239961840106 |
14 | 1026c759d12d |
15 | 71a28669d61 |
hex | 3bada633cf5 |
4101062737141 has 4 divisors (see below), whose sum is σ = 4103213270112. Its totient is φ = 4098912204172.
The previous prime is 4101062737111. The next prime is 4101062737153. The reversal of 4101062737141 is 1417372601014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4101062737141 - 231 = 4098915253493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4101062737141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4101062737111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1075263625 + ... + 1075267438.
It is an arithmetic number, because the mean of its divisors is an integer number (1025803317528).
Almost surely, 24101062737141 is an apocalyptic number.
It is an amenable number.
4101062737141 is a deficient number, since it is larger than the sum of its proper divisors (2150532971).
4101062737141 is a wasteful number, since it uses less digits than its factorization.
4101062737141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2150532970.
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 4101062737141 in words is "four trillion, one hundred one billion, sixty-two million, seven hundred thirty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •