Base | Representation |
---|---|
bin | 1100001010011… |
… | …0011001011111 |
3 | 10112222201222100 |
4 | 3002212121133 |
5 | 101024410330 |
6 | 5021220143 |
7 | 1156414401 |
oct | 302463137 |
9 | 115881870 |
10 | 51013215 |
11 | 26882a90 |
12 | 15101653 |
13 | a751646 |
14 | 6abcb71 |
15 | 472a060 |
hex | 30a665f |
51013215 has 48 divisors (see below), whose sum is σ = 97078176. Its totient is φ = 24576000.
The previous prime is 51013201. The next prime is 51013219. The reversal of 51013215 is 51231015.
It is not a de Polignac number, because 51013215 - 27 = 51013087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51013219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 127015 + ... + 127415.
It is an arithmetic number, because the mean of its divisors is an integer number (2022462).
Almost surely, 251013215 is an apocalyptic number.
51013215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51013215 is a deficient number, since it is larger than the sum of its proper divisors (46064961).
51013215 is a wasteful number, since it uses less digits than its factorization.
51013215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 680 (or 677 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 51013215 is about 7142.3536036800. The cubic root of 51013215 is about 370.8750048137.
The spelling of 51013215 in words is "fifty-one million, thirteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •