Base | Representation |
---|---|
bin | 1001101101101101… |
… | …00000010100100101 |
3 | 111110110100212221010 |
4 | 10312312200110211 |
5 | 41140044201000 |
6 | 2221300212433 |
7 | 243144452655 |
oct | 46666402445 |
9 | 14413325833 |
10 | 5215225125 |
11 | 2236949910 |
12 | 101669a119 |
13 | 651616b36 |
14 | 3768c8365 |
15 | 207cbbd50 |
hex | 136da0525 |
5215225125 has 64 divisors (see below), whose sum is σ = 9600933888. Its totient is φ = 2492840000.
The previous prime is 5215225123. The next prime is 5215225151.
5215225125 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5215225125 - 21 = 5215225123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5215225092 and 5215225101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5215225123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 283972 + ... + 301778.
It is an arithmetic number, because the mean of its divisors is an integer number (150014592).
Almost surely, 25215225125 is an apocalyptic number.
5215225125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5215225125 is a deficient number, since it is larger than the sum of its proper divisors (4385708763).
5215225125 is a wasteful number, since it uses less digits than its factorization.
5215225125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17907 (or 17897 counting only the distinct ones).
The product of its digits is 10000, while the sum is 30.
The square root of 5215225125 is about 72216.5155971956. The cubic root of 5215225125 is about 1734.1674091285.
It can be divided in two parts, 52152 and 25125, that added together give a palindrome (77277).
The spelling of 5215225125 in words is "five billion, two hundred fifteen million, two hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •