Base | Representation |
---|---|
bin | 101111100110000011… |
… | …100100100010000100 |
3 | 11212220112211020211100 |
4 | 233212003210202010 |
5 | 1314130202223004 |
6 | 35251011140100 |
7 | 3456261455151 |
oct | 574603444204 |
9 | 155815736740 |
10 | 51104336004 |
11 | 1a74507a037 |
12 | 9aa28a4630 |
13 | 4a857ab197 |
14 | 268b27b228 |
15 | 14e17d5739 |
hex | be60e4884 |
51104336004 has 36 divisors (see below), whose sum is σ = 136779253884. Its totient is φ = 16032732672.
The previous prime is 51104335963. The next prime is 51104336011. The reversal of 51104336004 is 40063340115.
51104336004 is a `hidden beast` number, since 5 + 1 + 10 + 43 + 3 + 600 + 4 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 24538595904 + 26565740100 = 156648^2 + 162990^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×511043360042 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41751297 + ... + 41752520.
It is an arithmetic number, because the mean of its divisors is an integer number (3799423719).
Almost surely, 251104336004 is an apocalyptic number.
It is an amenable number.
51104336004 is an abundant number, since it is smaller than the sum of its proper divisors (85674917880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51104336004 is a wasteful number, since it uses less digits than its factorization.
51104336004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83503844 (or 83503839 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 51104336004 its reverse (40063340115), we get a palindrome (91167676119).
The spelling of 51104336004 in words is "fifty-one billion, one hundred four million, three hundred thirty-six thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •