Base | Representation |
---|---|
bin | 1100001011101… |
… | …0001001001111 |
3 | 10120010211220220 |
4 | 3002322021033 |
5 | 101040002340 |
6 | 5023042423 |
7 | 1160202243 |
oct | 302721117 |
9 | 116124826 |
10 | 51094095 |
11 | 26928828 |
12 | 15140413 |
13 | a77c3c0 |
14 | 6b00423 |
15 | 4743ed0 |
hex | 30ba24f |
51094095 has 32 divisors (see below), whose sum is σ = 93223872. Its totient is φ = 23672832.
The previous prime is 51094093. The next prime is 51094139. The reversal of 51094095 is 59049015.
51094095 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51094095 - 21 = 51094093 is a prime.
It is a super-2 number, since 2×510940952 = 5221213087738050, which contains 22 as substring.
51094095 is a modest number, since divided by 94095 gives 510 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51094091) 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 31 ways as a sum of consecutive naturals, for example, 4392 + ... + 11021.
It is an arithmetic number, because the mean of its divisors is an integer number (2913246).
Almost surely, 251094095 is an apocalyptic number.
51094095 is a deficient number, since it is larger than the sum of its proper divisors (42129777).
51094095 is a wasteful number, since it uses less digits than its factorization.
51094095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15451.
The product of its (nonzero) digits is 8100, while the sum is 33.
The square root of 51094095 is about 7148.0133603680. The cubic root of 51094095 is about 371.0709052389.
The spelling of 51094095 in words is "fifty-one million, ninety-four thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •