Base | Representation |
---|---|
bin | 10010111011010111… |
… | …010100000101000101 |
3 | 1221110100220122002111 |
4 | 102323113110011011 |
5 | 313110232221013 |
6 | 13200355141021 |
7 | 1316426241124 |
oct | 227327240505 |
9 | 57410818074 |
10 | 20323320133 |
11 | 8689a91246 |
12 | 3b322a4771 |
13 | 1bbb67c11c |
14 | dab209abb |
15 | 7de33473d |
hex | 4bb5d4145 |
20323320133 has 4 divisors (see below), whose sum is σ = 20323647820. Its totient is φ = 20322992448.
The previous prime is 20323320131. The next prime is 20323320137. The reversal of 20323320133 is 33102332302.
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 8267719329 + 12055600804 = 90927^2 + 109798^2 .
It is a cyclic number.
It is not a de Polignac number, because 20323320133 - 21 = 20323320131 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 (20323320131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39210 + ... + 205387.
It is an arithmetic number, because the mean of its divisors is an integer number (5080911955).
Almost surely, 220323320133 is an apocalyptic number.
It is an amenable number.
20323320133 is a deficient number, since it is larger than the sum of its proper divisors (327687).
20323320133 is an equidigital number, since it uses as much as digits as its factorization.
20323320133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327686.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 20323320133 its reverse (33102332302), we get a palindrome (53425652435).
The spelling of 20323320133 in words is "twenty billion, three hundred twenty-three million, three hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •