Base | Representation |
---|---|
bin | 101111101001000011… |
… | …100101100110001110 |
3 | 11220001001112120212000 |
4 | 233221003211212032 |
5 | 1314231044001024 |
6 | 35300010053130 |
7 | 3460442352315 |
oct | 575103454616 |
9 | 156031476760 |
10 | 51154672014 |
11 | 1a77052a246 |
12 | 9ab771a1a6 |
13 | 4a930534c4 |
14 | 2693c2127c |
15 | 14e5e29cc9 |
hex | be90e598e |
51154672014 has 16 divisors (see below), whose sum is σ = 113677049040. Its totient is φ = 17051557320.
The previous prime is 51154672013. The next prime is 51154672033. The reversal of 51154672014 is 41027645115.
51154672014 is a `hidden beast` number, since 511 + 54 + 67 + 20 + 14 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 51154672014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51154672013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 473654317 + ... + 473654424.
It is an arithmetic number, because the mean of its divisors is an integer number (7104815565).
Almost surely, 251154672014 is an apocalyptic number.
51154672014 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
51154672014 is an abundant number, since it is smaller than the sum of its proper divisors (62522377026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51154672014 is a wasteful number, since it uses less digits than its factorization.
51154672014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947308752 (or 947308746 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The spelling of 51154672014 in words is "fifty-one billion, one hundred fifty-four million, six hundred seventy-two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •