Base | Representation |
---|---|
bin | 10111011111110010001100… |
… | …11011101001101001010000 |
3 | 20202221120100221001002020210 |
4 | 23233321012123221221100 |
5 | 23233023404341140324 |
6 | 301520412031004120 |
7 | 13612002542234511 |
oct | 1357710633515120 |
9 | 222846327032223 |
10 | 51669638224464 |
11 | 15510a748312a7 |
12 | 5965b09369640 |
13 | 22aa56cb466a0 |
14 | ca8b76856a08 |
15 | 5e90a4be1d29 |
hex | 2efe466e9a50 |
51669638224464 has 320 divisors, whose sum is σ = 153275272254720. Its totient is φ = 14857898065920.
The previous prime is 51669638224427. The next prime is 51669638224471. The reversal of 51669638224464 is 46442283696615.
It is a junction number, because it is equal to n+sod(n) for n = 51669638224395 and 51669638224404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2699694607 + ... + 2699713745.
It is an arithmetic number, because the mean of its divisors is an integer number (478985225796).
Almost surely, 251669638224464 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 51669638224464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76637636127360).
51669638224464 is an abundant number, since it is smaller than the sum of its proper divisors (101605634030256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51669638224464 is a wasteful number, since it uses less digits than its factorization.
51669638224464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20958 (or 20952 counting only the distinct ones).
The product of its digits is 358318080, while the sum is 66.
The spelling of 51669638224464 in words is "fifty-one trillion, six hundred sixty-nine billion, six hundred thirty-eight million, two hundred twenty-four thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •