Base | Representation |
---|---|
bin | 100000001100110111… |
… | …0001000010111110011 |
3 | 20121111020210202220001 |
4 | 1000121232020113303 |
5 | 2113110124000201 |
6 | 51433441530431 |
7 | 4665424542100 |
oct | 1003156102763 |
9 | 217436722801 |
10 | 69151000051 |
11 | 27365a33921 |
12 | 1149a643a17 |
13 | 66a0599613 |
14 | 34bdd73aa7 |
15 | 1bead0a301 |
hex | 1019b885f3 |
69151000051 has 24 divisors (see below), whose sum is σ = 83633464320. Its totient is φ = 56947438800.
The previous prime is 69151000043. The next prime is 69151000073. The reversal of 69151000051 is 15000015196.
It is not a de Polignac number, because 69151000051 - 23 = 69151000043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 69150999983 and 69151000019.
It is not an unprimeable number, because it can be changed into a prime (69151000651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47386 + ... + 374896.
It is an arithmetic number, because the mean of its divisors is an integer number (3484727680).
Almost surely, 269151000051 is an apocalyptic number.
69151000051 is a deficient number, since it is larger than the sum of its proper divisors (14482464269).
69151000051 is a wasteful number, since it uses less digits than its factorization.
69151000051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327695 (or 327688 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 28.
The spelling of 69151000051 in words is "sixty-nine billion, one hundred fifty-one million, fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •