Base | Representation |
---|---|
bin | 110110110011000010111000… |
… | …100100001011101101011011 |
3 | 1011121022121001202111000221210 |
4 | 312303002320210023231123 |
5 | 223042040203124443133 |
6 | 2212322532343234203 |
7 | 101522561460636102 |
oct | 6663027044135533 |
9 | 1147277052430853 |
10 | 241002301406043 |
11 | 6a877558254781 |
12 | 23043a3b148963 |
13 | a46255b86a2a8 |
14 | 437280605d039 |
15 | 1cce0525c0763 |
hex | db30b890bb5b |
241002301406043 has 8 divisors (see below), whose sum is σ = 321648076371456. Its totient is φ = 160512363689000.
The previous prime is 241002301406033. The next prime is 241002301406059. The reversal of 241002301406043 is 340604103200142.
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 241002301406043 - 217 = 241002301274971 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241002301406043.
It is not an unprimeable number, because it can be changed into a prime (241002301406033) 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, 38959308483 + ... + 38959314668.
It is an arithmetic number, because the mean of its divisors is an integer number (40206009546432).
Almost surely, 2241002301406043 is an apocalyptic number.
241002301406043 is a deficient number, since it is larger than the sum of its proper divisors (80645774965413).
241002301406043 is a wasteful number, since it uses less digits than its factorization.
241002301406043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77918624185.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 241002301406043 its reverse (340604103200142), we get a palindrome (581606404606185).
The spelling of 241002301406043 in words is "two hundred forty-one trillion, two billion, three hundred one million, four hundred six thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •