Base | Representation |
---|---|
bin | 100111001001011000… |
… | …010110100110101010 |
3 | 11000111101002101121210 |
4 | 213021120112212222 |
5 | 1142041011410442 |
6 | 31150531413550 |
7 | 3015424145436 |
oct | 471130264652 |
9 | 130441071553 |
10 | 42033310122 |
11 | 1690a787031 |
12 | 8190a542b6 |
13 | 3c6b3c044b |
14 | 206a6579c6 |
15 | 116027919c |
hex | 9c96169aa |
42033310122 has 8 divisors (see below), whose sum is σ = 84066620256. Its totient is φ = 14011103372.
The previous prime is 42033310117. The next prime is 42033310127. The reversal of 42033310122 is 22101333024.
It is an interprime number because it is at equal distance from previous prime (42033310117) and next prime (42033310127).
It is a sphenic number, since it is the product of 3 distinct primes.
42033310122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (42033310127) by changing a digit.
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, 3502775838 + ... + 3502775849.
It is an arithmetic number, because the mean of its divisors is an integer number (10508327532).
Almost surely, 242033310122 is an apocalyptic number.
42033310122 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.
42033310122 is a wasteful number, since it uses less digits than its factorization.
42033310122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7005551692.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 42033310122 its reverse (22101333024), we get a palindrome (64134643146).
The spelling of 42033310122 in words is "forty-two billion, thirty-three million, three hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •