Base | Representation |
---|---|
bin | 101111100010001010… |
… | …011000111110110000 |
3 | 11212201222220121000200 |
4 | 233202022120332300 |
5 | 1314011441433312 |
6 | 35240315115200 |
7 | 3454536316341 |
oct | 574212307660 |
9 | 155658817020 |
10 | 51039014832 |
11 | 1a7112142a3 |
12 | 9a84a42b00 |
13 | 4a750ba1c0 |
14 | 26827160c8 |
15 | 14dabd10dc |
hex | be2298fb0 |
51039014832 has 120 divisors (see below), whose sum is σ = 156433477200. Its totient is φ = 15438104064.
The previous prime is 51039014827. The next prime is 51039014833. The reversal of 51039014832 is 23841093015.
51039014832 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×510390148322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (51039014833) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 120607 + ... + 341502.
It is an arithmetic number, because the mean of its divisors is an integer number (1303612310).
Almost surely, 251039014832 is an apocalyptic number.
51039014832 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
51039014832 is an abundant number, since it is smaller than the sum of its proper divisors (105394462368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51039014832 is a wasteful number, since it uses less digits than its factorization.
51039014832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462195 (or 462186 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 51039014832 in words is "fifty-one billion, thirty-nine million, fourteen thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •