Base | Representation |
---|---|
bin | 10010111011010010… |
… | …010101000000101111 |
3 | 1221110021110020100201 |
4 | 102323102111000233 |
5 | 313104413410411 |
6 | 13200311134331 |
7 | 1316412155662 |
oct | 227322250057 |
9 | 57407406321 |
10 | 20322013231 |
11 | 8689279363 |
12 | 3b319743a7 |
13 | 1bbb312300 |
14 | daad896d9 |
15 | 7de1773c1 |
hex | 4bb49502f |
20322013231 has 24 divisors (see below), whose sum is σ = 23470461504. Its totient is φ = 17526113280.
The previous prime is 20322013223. The next prime is 20322013241. The reversal of 20322013231 is 13231022302.
It is not a de Polignac number, because 20322013231 - 23 = 20322013223 is a prime.
It is a super-2 number, since 2×203220132312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20322013199 and 20322013208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20322013241) 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 23 ways as a sum of consecutive naturals, for example, 367786 + ... + 419416.
It is an arithmetic number, because the mean of its divisors is an integer number (977935896).
Almost surely, 220322013231 is an apocalyptic number.
20322013231 is a deficient number, since it is larger than the sum of its proper divisors (3148448273).
20322013231 is a wasteful number, since it uses less digits than its factorization.
20322013231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51811 (or 51798 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20322013231 its reverse (13231022302), we get a palindrome (33553035533).
The spelling of 20322013231 in words is "twenty billion, three hundred twenty-two million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •