Base | Representation |
---|---|
bin | 1001100010111111… |
… | …00110100010101111 |
3 | 111020012020000011012 |
4 | 10301133212202233 |
5 | 40444041211330 |
6 | 2204325415435 |
7 | 241003426160 |
oct | 46137464257 |
9 | 14205200135 |
10 | 5125335215 |
11 | 21a0133230 |
12 | bb056a57b |
13 | 638b03040 |
14 | 3689a9767 |
15 | 1eee62c95 |
hex | 1317e68af |
5125335215 has 64 divisors (see below), whose sum is σ = 8692669440. Its totient is φ = 2793968640.
The previous prime is 5125335209. The next prime is 5125335223.
5125335215 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5125335215 - 28 = 5125334959 is a prime.
It is a super-2 number, since 2×51253352152 = 52538122132238192450, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 68147 + ... + 122043.
It is an arithmetic number, because the mean of its divisors is an integer number (135822960).
Almost surely, 25125335215 is an apocalyptic number.
5125335215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5125335215 is a deficient number, since it is larger than the sum of its proper divisors (3567334225).
5125335215 is a wasteful number, since it uses less digits than its factorization.
5125335215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53952.
The product of its digits is 22500, while the sum is 32.
The square root of 5125335215 is about 71591.4465212151. The cubic root of 5125335215 is about 1724.1462094252.
It can be divided in two parts, 51253 and 35215, that added together give a palindrome (86468).
The spelling of 5125335215 in words is "five billion, one hundred twenty-five million, three hundred thirty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •