Base | Representation |
---|---|
bin | 10010110101010101… |
… | …101100001101110101 |
3 | 1221012022200210102211 |
4 | 102311111230031311 |
5 | 312403342401123 |
6 | 13142344333421 |
7 | 1314061062616 |
oct | 226525541565 |
9 | 57168623384 |
10 | 20222231413 |
11 | 8637a1684a |
12 | 3b04474271 |
13 | 1ba3746c07 |
14 | d9ba13c0d |
15 | 7d551740d |
hex | 4b556c375 |
20222231413 has 4 divisors (see below), whose sum is σ = 20422451628. Its totient is φ = 20022011200.
The previous prime is 20222231363. The next prime is 20222231453. The reversal of 20222231413 is 31413222202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11135947729 + 9086283684 = 105527^2 + 95322^2 .
It is a cyclic number.
It is not a de Polignac number, because 20222231413 - 213 = 20222223221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222231453) 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 3 ways as a sum of consecutive naturals, for example, 100109956 + ... + 100110157.
It is an arithmetic number, because the mean of its divisors is an integer number (5105612907).
Almost surely, 220222231413 is an apocalyptic number.
It is an amenable number.
20222231413 is a deficient number, since it is larger than the sum of its proper divisors (200220215).
20222231413 is a wasteful number, since it uses less digits than its factorization.
20222231413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200220214.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 20222231413 its reverse (31413222202), we get a palindrome (51635453615).
The spelling of 20222231413 in words is "twenty billion, two hundred twenty-two million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •