Base | Representation |
---|---|
bin | 100110100011… |
… | …1011000010001 |
3 | 1102001001012022 |
4 | 1031013120101 |
5 | 20133342223 |
6 | 2001141225 |
7 | 333553526 |
oct | 115073021 |
9 | 42031168 |
10 | 20215313 |
11 | 10458078 |
12 | 692a815 |
13 | 425a431 |
14 | 298314d |
15 | 1b94ac8 |
hex | 1347611 |
20215313 has 8 divisors (see below), whose sum is σ = 20697768. Its totient is φ = 19736704.
The previous prime is 20215303. The next prime is 20215319. The reversal of 20215313 is 31351202.
It can be written as a sum of positive squares in 4 ways, for example, as 37249 + 20178064 = 193^2 + 4492^2 .
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 20215313 - 210 = 20214289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20215291 and 20215300.
It is not an unprimeable number, because it can be changed into a prime (20215319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11531 + ... + 13167.
It is an arithmetic number, because the mean of its divisors is an integer number (2587221).
Almost surely, 220215313 is an apocalyptic number.
It is an amenable number.
20215313 is a deficient number, since it is larger than the sum of its proper divisors (482455).
20215313 is a wasteful number, since it uses less digits than its factorization.
20215313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1923.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 20215313 is about 4496.1442370102. The cubic root of 20215313 is about 272.4123692078.
Adding to 20215313 its reverse (31351202), we get a palindrome (51566515).
The spelling of 20215313 in words is "twenty million, two hundred fifteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •