Base | Representation |
---|---|
bin | 11000110111101110110111… |
… | …11001000010010000000000 |
3 | 21011122110100012122221110121 |
4 | 30123313123321002100000 |
5 | 24132031201440213241 |
6 | 312152533134110024 |
7 | 14343221355306220 |
oct | 1433673371022000 |
9 | 234573305587417 |
10 | 54691507741696 |
11 | 164765a1351a61 |
12 | 61736b734b314 |
13 | 2469505471117 |
14 | d71124046080 |
15 | 64c9b938cad1 |
hex | 31bddbe42400 |
54691507741696 has 176 divisors, whose sum is σ = 129104346857472. Its totient is φ = 22661017804800.
The previous prime is 54691507741687. The next prime is 54691507741709. The reversal of 54691507741696 is 69614770519645.
It is a super-2 number, since 2×546915077416962 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 228977085 + ... + 229215811.
Almost surely, 254691507741696 is an apocalyptic number.
54691507741696 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54691507741696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64552173428736).
54691507741696 is an abundant number, since it is smaller than the sum of its proper divisors (74412839115776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54691507741696 is a wasteful number, since it uses less digits than its factorization.
54691507741696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239816 (or 239798 counting only the distinct ones).
The product of its (nonzero) digits is 342921600, while the sum is 70.
The spelling of 54691507741696 in words is "fifty-four trillion, six hundred ninety-one billion, five hundred seven million, seven hundred forty-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •