Base | Representation |
---|---|
bin | 10111011111100101000110… |
… | …01100001101011101110000 |
3 | 20202220220012201220001021002 |
4 | 23233302203030031131300 |
5 | 23232420003224222001 |
6 | 301513250050221132 |
7 | 13611333333613400 |
oct | 1357624314153560 |
9 | 222826181801232 |
10 | 51662604523376 |
11 | 15508a954595a0 |
12 | 59646858847a8 |
13 | 22a99bb870c92 |
14 | ca86aa646800 |
15 | 5e8ce246c46b |
hex | 2efca330d770 |
51662604523376 has 120 divisors (see below), whose sum is σ = 127993521997440. Its totient is φ = 19974635990400.
The previous prime is 51662604523331. The next prime is 51662604523391. The reversal of 51662604523376 is 67332540626615.
It is a super-2 number, since 2×516626045233762 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21734996 + ... + 23994483.
It is an arithmetic number, because the mean of its divisors is an integer number (1066612683312).
Almost surely, 251662604523376 is an apocalyptic number.
51662604523376 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
51662604523376 is an abundant number, since it is smaller than the sum of its proper divisors (76330917474064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51662604523376 is a wasteful number, since it uses less digits than its factorization.
51662604523376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45729643 (or 45729630 counting only the distinct ones).
The product of its (nonzero) digits is 32659200, while the sum is 56.
The spelling of 51662604523376 in words is "fifty-one trillion, six hundred sixty-two billion, six hundred four million, five hundred twenty-three thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •