Base | Representation |
---|---|
bin | 100111001000110101… |
… | …100111000010110110 |
3 | 11000110201221200012120 |
4 | 213020311213002312 |
5 | 1142031143434142 |
6 | 31150004300410 |
7 | 3015253553406 |
oct | 471065470266 |
9 | 130421850176 |
10 | 42024202422 |
11 | 16905626304 |
12 | 81899a1706 |
13 | 3c69551a87 |
14 | 2069366806 |
15 | 115e57a7ec |
hex | 9c8d670b6 |
42024202422 has 8 divisors (see below), whose sum is σ = 84048404856. Its totient is φ = 14008067472.
The previous prime is 42024202421. The next prime is 42024202457. The reversal of 42024202422 is 22420242024.
42024202422 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.
42024202422 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 42024202392 and 42024202401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42024202421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3502016863 + ... + 3502016874.
It is an arithmetic number, because the mean of its divisors is an integer number (10506050607).
Almost surely, 242024202422 is an apocalyptic number.
42024202422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42024202422 is a wasteful number, since it uses less digits than its factorization.
42024202422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7004033742.
The product of its (nonzero) digits is 4096, while the sum is 24.
Adding to 42024202422 its reverse (22420242024), we get a palindrome (64444444446).
The spelling of 42024202422 in words is "forty-two billion, twenty-four million, two hundred two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •