Base | Representation |
---|---|
bin | 10011001111001101010111… |
… | …00011010000001000001101 |
3 | 12112210020001021012000002110 |
4 | 21213212223203100020031 |
5 | 21021102103311341331 |
6 | 225550105553014233 |
7 | 11624235554554155 |
oct | 1147465343201015 |
9 | 175706037160073 |
10 | 42304011043341 |
11 | 12530037409403 |
12 | 48b2973854379 |
13 | 1a7b335947858 |
14 | a6374ca97765 |
15 | 4d56575b0946 |
hex | 2679ab8d020d |
42304011043341 has 8 divisors (see below), whose sum is σ = 56405891809120. Its totient is φ = 28202402153232.
The previous prime is 42304011043279. The next prime is 42304011043351. The reversal of 42304011043341 is 14334011040324.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42304011043341 - 219 = 42304010519053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42304011043299 and 42304011043308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42304011043351) 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, 67605571 + ... + 68228448.
It is an arithmetic number, because the mean of its divisors is an integer number (7050736476140).
Almost surely, 242304011043341 is an apocalyptic number.
It is an amenable number.
42304011043341 is a deficient number, since it is larger than the sum of its proper divisors (14101880765779).
42304011043341 is a wasteful number, since it uses less digits than its factorization.
42304011043341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135937835.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 42304011043341 its reverse (14334011040324), we get a palindrome (56638022083665).
The spelling of 42304011043341 in words is "forty-two trillion, three hundred four billion, eleven million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •