Base | Representation |
---|---|
bin | 111011101100100000101… |
… | …001001101000111110001 |
3 | 112112011121021000000011002 |
4 | 323230200221031013301 |
5 | 1014202342302041431 |
6 | 12420313234531345 |
7 | 602243236624610 |
oct | 73544051150761 |
9 | 15464537000132 |
10 | 4102241440241 |
11 | 1341829390a1a |
12 | 563060436b55 |
13 | 239abbab8a79 |
14 | 102799d47877 |
15 | 71a96d9a3cb |
hex | 3bb20a4d1f1 |
4102241440241 has 8 divisors (see below), whose sum is σ = 4688289622080. Its totient is φ = 3516196681008.
The previous prime is 4102241440217. The next prime is 4102241440259. The reversal of 4102241440241 is 1420441422014.
4102241440241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4102241440241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4102241440441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2694995 + ... + 3932871.
It is an arithmetic number, because the mean of its divisors is an integer number (586036202760).
Almost surely, 24102241440241 is an apocalyptic number.
It is an amenable number.
4102241440241 is a deficient number, since it is larger than the sum of its proper divisors (586048181839).
4102241440241 is a wasteful number, since it uses less digits than its factorization.
4102241440241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1711303.
The product of its (nonzero) digits is 8192, while the sum is 29.
Adding to 4102241440241 its reverse (1420441422014), we get a palindrome (5522682862255).
The spelling of 4102241440241 in words is "four trillion, one hundred two billion, two hundred forty-one million, four hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •