Base | Representation |
---|---|
bin | 110110110011010110001100… |
… | …110000000000001011001101 |
3 | 1011121101120121010221212020011 |
4 | 312303112030300000023031 |
5 | 223042410142013043001 |
6 | 2212340242335553221 |
7 | 101524224434540011 |
oct | 6663261460001315 |
9 | 1147346533855204 |
10 | 241023041143501 |
11 | 6a8853302a4471 |
12 | 23047a6898b811 |
13 | a4644b55884a6 |
14 | 43738126a4541 |
15 | 1cce86825cd51 |
hex | db358cc002cd |
241023041143501 has 8 divisors (see below), whose sum is σ = 257281823016000. Its totient is φ = 225121595136480.
The previous prime is 241023041143429. The next prime is 241023041143517. The reversal of 241023041143501 is 105341140320142.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 241023041143501 - 213 = 241023041135309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241023041143561) 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, 89333964976 + ... + 89333967673.
It is an arithmetic number, because the mean of its divisors is an integer number (32160227877000).
Almost surely, 2241023041143501 is an apocalyptic number.
It is an amenable number.
241023041143501 is a deficient number, since it is larger than the sum of its proper divisors (16258781872499).
241023041143501 is a wasteful number, since it uses less digits than its factorization.
241023041143501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178667932739.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 241023041143501 its reverse (105341140320142), we get a palindrome (346364181463643).
The spelling of 241023041143501 in words is "two hundred forty-one trillion, twenty-three billion, forty-one million, one hundred forty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •