Base | Representation |
---|---|
bin | 10011001110010111… |
… | …110101010011111001 |
3 | 1222021120222121001212 |
4 | 103032113311103321 |
5 | 314233402121403 |
6 | 13252150252505 |
7 | 1330351001123 |
oct | 231627652371 |
9 | 58246877055 |
10 | 20642223353 |
11 | 8832aa6a24 |
12 | 4001057135 |
13 | 1c3c76805b |
14 | ddb700213 |
15 | 80c3294d8 |
hex | 4ce5f54f9 |
20642223353 has 4 divisors (see below), whose sum is σ = 20646450420. Its totient is φ = 20637996288.
The previous prime is 20642223347. The next prime is 20642223391. The reversal of 20642223353 is 35332224602.
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 5104102249 + 15538121104 = 71443^2 + 124652^2 .
It is a cyclic number.
It is not a de Polignac number, because 20642223353 - 216 = 20642157817 is a prime.
It is a super-2 number, since 2×206422233532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20642223323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2106200 + ... + 2115977.
It is an arithmetic number, because the mean of its divisors is an integer number (5161612605).
Almost surely, 220642223353 is an apocalyptic number.
It is an amenable number.
20642223353 is a deficient number, since it is larger than the sum of its proper divisors (4227067).
20642223353 is an equidigital number, since it uses as much as digits as its factorization.
20642223353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4227066.
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 20642223353 its reverse (35332224602), we get a palindrome (55974447955).
The spelling of 20642223353 in words is "twenty billion, six hundred forty-two million, two hundred twenty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •