Base | Representation |
---|---|
bin | 1001001111000110111010… |
… | …00111111011110011101101 |
3 | 2122220122110210022000100122 |
4 | 10213203131013323303231 |
5 | 10130231011144021310 |
6 | 111110232514134325 |
7 | 4164241354616453 |
oct | 447433507736355 |
9 | 78818423260318 |
10 | 20310315220205 |
11 | 65206134a8a0a |
12 | 23403375813a5 |
13 | b443401c952a |
14 | 50304b3389d3 |
15 | 2534b7e1b555 |
hex | 1278dd1fbced |
20310315220205 has 8 divisors (see below), whose sum is σ = 24372885034104. Its totient is φ = 16247914329600.
The previous prime is 20310315220193. The next prime is 20310315220231. The reversal of 20310315220205 is 50202251301302.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6646099468009 + 13664215752196 = 2578003^2 + 3696514^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20310315220205 - 238 = 20035437313261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41966156 + ... + 42447365.
It is an arithmetic number, because the mean of its divisors is an integer number (3046610629263).
Almost surely, 220310315220205 is an apocalyptic number.
It is an amenable number.
20310315220205 is a deficient number, since it is larger than the sum of its proper divisors (4062569813899).
20310315220205 is an equidigital number, since it uses as much as digits as its factorization.
20310315220205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84461647.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 20310315220205 its reverse (50202251301302), we get a palindrome (70512566521507).
The spelling of 20310315220205 in words is "twenty trillion, three hundred ten billion, three hundred fifteen million, two hundred twenty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •