Base | Representation |
---|---|
bin | 10010110110100101… |
… | …110000101110101110 |
3 | 1221020210012012022120 |
4 | 102312211300232232 |
5 | 312424231041142 |
6 | 13144414253410 |
7 | 1314434354154 |
oct | 226645605656 |
9 | 57223165276 |
10 | 20243221422 |
11 | 8648852966 |
12 | 3b0b4b7266 |
13 | 1ba7bb5b38 |
14 | da07193d4 |
15 | 7d72b17ec |
hex | 4b6970bae |
20243221422 has 96 divisors (see below), whose sum is σ = 43288560000. Its totient is φ = 6302464896.
The previous prime is 20243221421. The next prime is 20243221423. The reversal of 20243221422 is 22412234202.
It is an interprime number because it is at equal distance from previous prime (20243221421) and next prime (20243221423).
It is a junction number, because it is equal to n+sod(n) for n = 20243221392 and 20243221401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20243221421) 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 47 ways as a sum of consecutive naturals, for example, 40567329 + ... + 40567827.
It is an arithmetic number, because the mean of its divisors is an integer number (450922500).
Almost surely, 220243221422 is an apocalyptic number.
20243221422 is an abundant number, since it is smaller than the sum of its proper divisors (23045338578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20243221422 is a wasteful number, since it uses less digits than its factorization.
20243221422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722 (or 669 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 20243221422 its reverse (22412234202), we get a palindrome (42655455624).
The spelling of 20243221422 in words is "twenty billion, two hundred forty-three million, two hundred twenty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •