Base | Representation |
---|---|
bin | 10011100010010010111111 |
3 | 100122011222122 |
4 | 103202102333 |
5 | 2302334330 |
6 | 301433155 |
7 | 61346441 |
oct | 23422277 |
9 | 10564878 |
10 | 5121215 |
11 | 2988710 |
12 | 186b7bb |
13 | 10a4008 |
14 | 974491 |
15 | 6b25e5 |
hex | 4e24bf |
5121215 has 8 divisors (see below), whose sum is σ = 6704208. Its totient is φ = 3724480.
The previous prime is 5121211. The next prime is 5121223.
5121215 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5121215 - 22 = 5121211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5121193 and 5121202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5121211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46502 + ... + 46611.
It is an arithmetic number, because the mean of its divisors is an integer number (838026).
Almost surely, 25121215 is an apocalyptic number.
5121215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5121215 is a deficient number, since it is larger than the sum of its proper divisors (1582993).
5121215 is a wasteful number, since it uses less digits than its factorization.
5121215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93129.
The product of its digits is 100, while the sum is 17.
The square root of 5121215 is about 2263.0101634770. The cubic root of 5121215 is about 172.3684076563.
It can be divided in two parts, 51212 and 15, that multiplied together give a triangular number (768180 = T1239).
The spelling of 5121215 in words is "five million, one hundred twenty-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •