Base | Representation |
---|---|
bin | 101111101000110011… |
… | …100010100001000101 |
3 | 11220000202121212001010 |
4 | 233220303202201011 |
5 | 1314224004340333 |
6 | 35255335552433 |
7 | 3460361531250 |
oct | 575063424105 |
9 | 156022555033 |
10 | 51150465093 |
11 | 1a769116552 |
12 | 9ab622b719 |
13 | 4a9220c6c0 |
14 | 2693448097 |
15 | 14e5898563 |
hex | be8ce2845 |
51150465093 has 32 divisors (see below), whose sum is σ = 86646956032. Its totient is φ = 26110123200.
The previous prime is 51150465073. The next prime is 51150465097. The reversal of 51150465093 is 39056405115.
It is a happy number.
It is not a de Polignac number, because 51150465093 - 29 = 51150464581 is a prime.
It is a super-2 number, since 2×511504650932 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51150465097) 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 31 ways as a sum of consecutive naturals, for example, 3013543 + ... + 3030468.
It is an arithmetic number, because the mean of its divisors is an integer number (2707717376).
Almost surely, 251150465093 is an apocalyptic number.
It is an amenable number.
51150465093 is a deficient number, since it is larger than the sum of its proper divisors (35496490939).
51150465093 is a wasteful number, since it uses less digits than its factorization.
51150465093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6044065.
The product of its (nonzero) digits is 81000, while the sum is 39.
The spelling of 51150465093 in words is "fifty-one billion, one hundred fifty million, four hundred sixty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •