Base | Representation |
---|---|
bin | 10010111011001110… |
… | …100010110001100111 |
3 | 1221110012120211022120 |
4 | 102323032202301213 |
5 | 313104140133111 |
6 | 13200234001023 |
7 | 1316400554163 |
oct | 227316426147 |
9 | 57405524276 |
10 | 20321021031 |
11 | 8688760963 |
12 | 3b31576173 |
13 | 1bbb0557cc |
14 | daababca3 |
15 | 7de02d406 |
hex | 4bb3a2c67 |
20321021031 has 8 divisors (see below), whose sum is σ = 27399129840. Its totient is φ = 13395129792.
The previous prime is 20321020991. The next prime is 20321021059. The reversal of 20321021031 is 13012012302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20321021031 - 211 = 20321018983 is a prime.
It is a super-2 number, since 2×203210210312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20321021031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20321021731) 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, 38054080 + ... + 38054613.
It is an arithmetic number, because the mean of its divisors is an integer number (3424891230).
Almost surely, 220321021031 is an apocalyptic number.
20321021031 is a deficient number, since it is larger than the sum of its proper divisors (7078108809).
20321021031 is an equidigital number, since it uses as much as digits as its factorization.
20321021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76108785.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20321021031 its reverse (13012012302), we get a palindrome (33333033333).
The spelling of 20321021031 in words is "twenty billion, three hundred twenty-one million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •