Base | Representation |
---|---|
bin | 1100001011010… |
… | …0000011011111 |
3 | 10120002120201001 |
4 | 3002310003133 |
5 | 101033203101 |
6 | 5022331131 |
7 | 1160036440 |
oct | 302640337 |
9 | 116076631 |
10 | 51069151 |
11 | 26911011 |
12 | 15129aa7 |
13 | a770c43 |
14 | 6ad52c7 |
15 | 473b901 |
hex | 30b40df |
51069151 has 16 divisors (see below), whose sum is σ = 59398144. Its totient is φ = 43006464.
The previous prime is 51069133. The next prime is 51069181. The reversal of 51069151 is 15196015.
51069151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51069151 - 211 = 51067103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51069181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138970 + ... + 139336.
It is an arithmetic number, because the mean of its divisors is an integer number (3712384).
Almost surely, 251069151 is an apocalyptic number.
51069151 is a deficient number, since it is larger than the sum of its proper divisors (8328993).
51069151 is a wasteful number, since it uses less digits than its factorization.
51069151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670.
The product of its (nonzero) digits is 1350, while the sum is 28.
The square root of 51069151 is about 7146.2683268962. The cubic root of 51069151 is about 371.0105101364.
It can be divided in two parts, 5 and 1069151, that added together give a square (1069156 = 10342).
The spelling of 51069151 in words is "fifty-one million, sixty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •