Base | Representation |
---|---|
bin | 10010111011100010… |
… | …000011010011110111 |
3 | 1221110120012122101222 |
4 | 102323202003103313 |
5 | 313111442310111 |
6 | 13200535340555 |
7 | 1316462203616 |
oct | 227342032367 |
9 | 57416178358 |
10 | 20326135031 |
11 | 8690634104 |
12 | 3b3322175b |
13 | 1bbc126447 |
14 | dab73d87d |
15 | 7de6dd7db |
hex | 4bb8834f7 |
20326135031 has 8 divisors (see below), whose sum is σ = 20831949600. Its totient is φ = 19820799360.
The previous prime is 20326134991. The next prime is 20326135043. The reversal of 20326135031 is 13053162302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20326135031 - 26 = 20326134967 is a prime.
It is a super-3 number, since 3×203261350313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20326135331) 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, 33011 + ... + 204308.
It is an arithmetic number, because the mean of its divisors is an integer number (2603993700).
Almost surely, 220326135031 is an apocalyptic number.
20326135031 is a deficient number, since it is larger than the sum of its proper divisors (505814569).
20326135031 is a wasteful number, since it uses less digits than its factorization.
20326135031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239449.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 20326135031 its reverse (13053162302), we get a palindrome (33379297333).
The spelling of 20326135031 in words is "twenty billion, three hundred twenty-six million, one hundred thirty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •