Base | Representation |
---|---|
bin | 1100010010101000100… |
… | …10111010101011100110 |
3 | 1111101002021112200200210 |
4 | 12021110102322223212 |
5 | 23404403141240402 |
6 | 522002301320250 |
7 | 42340336416453 |
oct | 6112422725346 |
9 | 1441067480623 |
10 | 422321040102 |
11 | 153118243185 |
12 | 69a22566086 |
13 | 30a94b46a90 |
14 | 1662483282a |
15 | aebb2e006c |
hex | 62544baae6 |
422321040102 has 64 divisors (see below), whose sum is σ = 928026537984. Its totient is φ = 127334972160.
The previous prime is 422321040077. The next prime is 422321040109. The reversal of 422321040102 is 201040123224.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422321040109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 786618 + ... + 1209714.
It is an arithmetic number, because the mean of its divisors is an integer number (14500414656).
Almost surely, 2422321040102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 422321040102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (464013268992).
422321040102 is an abundant number, since it is smaller than the sum of its proper divisors (505705497882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
422321040102 is a wasteful number, since it uses less digits than its factorization.
422321040102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423373.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 422321040102 its reverse (201040123224), we get a palindrome (623361163326).
The spelling of 422321040102 in words is "four hundred twenty-two billion, three hundred twenty-one million, forty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •