Base | Representation |
---|---|
bin | 10010111010111000… |
… | …110001100001111101 |
3 | 1221102210211220011012 |
4 | 102322320301201331 |
5 | 313101210024201 |
6 | 13155511405005 |
7 | 1316301215402 |
oct | 227270614175 |
9 | 57383756135 |
10 | 20315314301 |
11 | 8685513357 |
12 | 3b2b683765 |
13 | 1bb9b08149 |
14 | daa1242a9 |
15 | 7dd7a25bb |
hex | 4bae3187d |
20315314301 has 4 divisors (see below), whose sum is σ = 20698622172. Its totient is φ = 19932006432.
The previous prime is 20315314249. The next prime is 20315314307. The reversal of 20315314301 is 10341351302.
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 6427870276 + 13887444025 = 80174^2 + 117845^2 .
It is a cyclic number.
It is not a de Polignac number, because 20315314301 - 230 = 19241572477 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 (20315314307) 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 3 ways as a sum of consecutive naturals, for example, 191653856 + ... + 191653961.
It is an arithmetic number, because the mean of its divisors is an integer number (5174655543).
Almost surely, 220315314301 is an apocalyptic number.
It is an amenable number.
20315314301 is a deficient number, since it is larger than the sum of its proper divisors (383307871).
20315314301 is an equidigital number, since it uses as much as digits as its factorization.
20315314301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383307870.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 20315314301 its reverse (10341351302), we get a palindrome (30656665603).
The spelling of 20315314301 in words is "twenty billion, three hundred fifteen million, three hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •