Base | Representation |
---|---|
bin | 100111010101001010… |
… | …100100001101010110 |
3 | 11001000011010012220120 |
4 | 213111022210031112 |
5 | 1142442120204142 |
6 | 31222313212410 |
7 | 3023344524231 |
oct | 472512441526 |
9 | 131004105816 |
10 | 42231022422 |
11 | 16a01347226 |
12 | 8227101106 |
13 | 3ca0356384 |
14 | 2088a02418 |
15 | 11727d07ec |
hex | 9d52a4356 |
42231022422 has 8 divisors (see below), whose sum is σ = 84462044856. Its totient is φ = 14077007472.
The previous prime is 42231022409. The next prime is 42231022433. The reversal of 42231022422 is 22422013224.
It is a sphenic number, since it is the product of 3 distinct primes.
42231022422 is an admirable number.
It is a super-3 number, since 3×422310224223 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42231022392 and 42231022401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3519251863 + ... + 3519251874.
It is an arithmetic number, because the mean of its divisors is an integer number (10557755607).
Almost surely, 242231022422 is an apocalyptic number.
42231022422 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.
42231022422 is a wasteful number, since it uses less digits than its factorization.
42231022422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7038503742.
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 42231022422 its reverse (22422013224), we get a palindrome (64653035646).
The spelling of 42231022422 in words is "forty-two billion, two hundred thirty-one million, twenty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •