Base | Representation |
---|---|
bin | 100111100000000001… |
… | …111010010011111011 |
3 | 11001110212010000220101 |
4 | 213200001322103323 |
5 | 1143330301144120 |
6 | 31252344140231 |
7 | 3031020061465 |
oct | 474001722373 |
9 | 131425100811 |
10 | 42413303035 |
11 | 16a95227364 |
12 | 8278167677 |
13 | 3ccc04831c |
14 | 20a4cd1135 |
15 | 11837d990a |
hex | 9e007a4fb |
42413303035 has 4 divisors (see below), whose sum is σ = 50895963648. Its totient is φ = 33930642424.
The previous prime is 42413303029. The next prime is 42413303057. The reversal of 42413303035 is 53030331424.
42413303035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 42413303035 - 211 = 42413300987 is a prime.
It is a super-2 number, since 2×424133030352 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42413302994 and 42413303012.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4241330299 + ... + 4241330308.
It is an arithmetic number, because the mean of its divisors is an integer number (12723990912).
Almost surely, 242413303035 is an apocalyptic number.
42413303035 is a deficient number, since it is larger than the sum of its proper divisors (8482660613).
42413303035 is an equidigital number, since it uses as much as digits as its factorization.
42413303035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8482660612.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 42413303035 its reverse (53030331424), we get a palindrome (95443634459).
The spelling of 42413303035 in words is "forty-two billion, four hundred thirteen million, three hundred three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •