Base | Representation |
---|---|
bin | 101111110010100111… |
… | …011000101100110011 |
3 | 11220110020022200220010 |
4 | 233302213120230303 |
5 | 1320043123120230 |
6 | 35323535350003 |
7 | 3464430511413 |
oct | 576247305463 |
9 | 156406280803 |
10 | 51315051315 |
11 | 1a843010620 |
12 | 9b41382303 |
13 | 4aba3477b8 |
14 | 26ab24c643 |
15 | 15050599b0 |
hex | bf29d8b33 |
51315051315 has 64 divisors (see below), whose sum is σ = 90754919424. Its totient is φ = 24552000000.
The previous prime is 51315051253. The next prime is 51315051317.
51315051315 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51315051315 - 212 = 51315047219 is a prime.
It is a super-2 number, since 2×513150513152 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51315051317) 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, 5177865 + ... + 5187765.
It is an arithmetic number, because the mean of its divisors is an integer number (1418045616).
Almost surely, 251315051315 is an apocalyptic number.
51315051315 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51315051315 is a deficient number, since it is larger than the sum of its proper divisors (39439868109).
51315051315 is a wasteful number, since it uses less digits than its factorization.
51315051315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10332.
The product of its (nonzero) digits is 5625, while the sum is 30.
It can be divided in two parts, 513150 and 51315, that added together give a palindrome (564465).
The spelling of 51315051315 in words is "fifty-one billion, three hundred fifteen million, fifty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •