Base | Representation |
---|---|
bin | 101111100000000110… |
… | …110000111101011000 |
3 | 11212122120222120100102 |
4 | 233200012300331120 |
5 | 1313424123310130 |
6 | 35233043354532 |
7 | 3453640116311 |
oct | 574006607530 |
9 | 155576876312 |
10 | 51004510040 |
11 | 1a6a3797340 |
12 | 9a75382a48 |
13 | 4a6abc8973 |
14 | 267bcd3608 |
15 | 14d7b67645 |
hex | be01b0f58 |
51004510040 has 128 divisors (see below), whose sum is σ = 128672893440. Its totient is φ = 18034560000.
The previous prime is 51004510031. The next prime is 51004510093. The reversal of 51004510040 is 4001540015.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 51004509994 and 51004510021.
It is a congruent number.
It is an unprimeable number.
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, 5605895 + ... + 5614985.
It is an arithmetic number, because the mean of its divisors is an integer number (1005256980).
Almost surely, 251004510040 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51004510040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64336446720).
51004510040 is an abundant number, since it is smaller than the sum of its proper divisors (77668383400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51004510040 is a wasteful number, since it uses less digits than its factorization.
51004510040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9465 (or 9461 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The spelling of 51004510040 in words is "fifty-one billion, four million, five hundred ten thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •