Base | Representation |
---|---|
bin | 10111010100010100101011… |
… | …10111001101010010111111 |
3 | 20201112220220000122110121122 |
4 | 23222022111313031102333 |
5 | 23210100401431412330 |
6 | 301015443132421155 |
7 | 13541361651316652 |
oct | 1352122567152277 |
9 | 221486800573548 |
10 | 51275833857215 |
11 | 15379a604aa550 |
12 | 59017250177bb |
13 | 227c3a0c8c636 |
14 | c93a99469899 |
15 | 5ddc071c65e5 |
hex | 2ea295dcd4bf |
51275833857215 has 32 divisors (see below), whose sum is σ = 67669290501120. Its totient is φ = 36990124617600.
The previous prime is 51275833857211. The next prime is 51275833857223.
51275833857215 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51275833857215 - 22 = 51275833857211 is a prime.
It is a super-2 number, since 2×512758338572152 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51275833857211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3562295 + ... + 10735064.
It is an arithmetic number, because the mean of its divisors is an integer number (2114665328160).
Almost surely, 251275833857215 is an apocalyptic number.
51275833857215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51275833857215 is a deficient number, since it is larger than the sum of its proper divisors (16393456643905).
51275833857215 is a wasteful number, since it uses less digits than its factorization.
51275833857215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14297903.
The product of its digits is 70560000, while the sum is 62.
The spelling of 51275833857215 in words is "fifty-one trillion, two hundred seventy-five billion, eight hundred thirty-three million, eight hundred fifty-seven thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •