Base | Representation |
---|---|
bin | 10011010011100000000111… |
… | …10101000110010111101011 |
3 | 12120022022210111012110120001 |
4 | 21221300003311012113223 |
5 | 21031011203334130120 |
6 | 230141543131243431 |
7 | 11641010156546422 |
oct | 1151600365062753 |
9 | 176268714173501 |
10 | 42451521005035 |
11 | 1258765299795a |
12 | 49174805a9577 |
13 | 1a8c213374b5c |
14 | a6a94386c2b9 |
15 | 4d93dc780e0a |
hex | 269c03d465eb |
42451521005035 has 8 divisors (see below), whose sum is σ = 51170263885440. Its totient is φ = 33808924351104.
The previous prime is 42451521005011. The next prime is 42451521005077. The reversal of 42451521005035 is 53050012515424.
42451521005035 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 not a de Polignac number, because 42451521005035 - 211 = 42451521002987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42451521004985 and 42451521005003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19036555390 + ... + 19036557619.
It is an arithmetic number, because the mean of its divisors is an integer number (6396282985680).
Almost surely, 242451521005035 is an apocalyptic number.
42451521005035 is a deficient number, since it is larger than the sum of its proper divisors (8718742880405).
42451521005035 is a wasteful number, since it uses less digits than its factorization.
42451521005035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38073113237.
The product of its (nonzero) digits is 120000, while the sum is 37.
The spelling of 42451521005035 in words is "forty-two trillion, four hundred fifty-one billion, five hundred twenty-one million, five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •