Base | Representation |
---|---|
bin | 10010110100001101… |
… | …001101101111101001 |
3 | 1221010222221112110111 |
4 | 102310031031233221 |
5 | 312334011412413 |
6 | 13140425214321 |
7 | 1313440432462 |
oct | 226415155751 |
9 | 57128845414 |
10 | 20203232233 |
11 | 862821a448 |
12 | 3aba0313a1 |
13 | 1b9c8241b2 |
14 | d992a9d69 |
15 | 7d3a12d3d |
hex | 4b434dbe9 |
20203232233 has 8 divisors (see below), whose sum is σ = 20587349448. Its totient is φ = 19819223424.
The previous prime is 20203232213. The next prime is 20203232251. The reversal of 20203232233 is 33223230202.
It can be written as a sum of positive squares in 4 ways, for example, as 12464159449 + 7739072784 = 111643^2 + 87972^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20203232233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20203232213) 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 7 ways as a sum of consecutive naturals, for example, 417885 + ... + 463717.
It is an arithmetic number, because the mean of its divisors is an integer number (2573418681).
Almost surely, 220203232233 is an apocalyptic number.
It is an amenable number.
20203232233 is a deficient number, since it is larger than the sum of its proper divisors (384117215).
20203232233 is an equidigital number, since it uses as much as digits as its factorization.
20203232233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54203.
The product of its (nonzero) digits is 2592, while the sum is 22.
Adding to 20203232233 its reverse (33223230202), we get a palindrome (53426462435).
The spelling of 20203232233 in words is "twenty billion, two hundred three million, two hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •