Base | Representation |
---|---|
bin | 11000011011111101… |
… | …001001000000000000 |
3 | 2111201121221222020111 |
4 | 120123331021000000 |
5 | 412214114110011 |
6 | 20015352521104 |
7 | 1616136154402 |
oct | 303375110000 |
9 | 74647858214 |
10 | 26238816256 |
11 | 10145145014 |
12 | 51033b0194 |
13 | 262209b7a3 |
14 | 13acadcb72 |
15 | a38829121 |
hex | 61bf49000 |
26238816256 has 39 divisors (see below), whose sum is σ = 52491966163. Its totient is φ = 13114224640.
The previous prime is 26238816239. The next prime is 26238816271. The reversal of 26238816256 is 65261883262.
The square root of 26238816256 is 161984.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×262388162562 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 10365711 + ... + 10368241.
Almost surely, 226238816256 is an apocalyptic number.
26238816256 is the 161984-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26238816256
26238816256 is an abundant number, since it is smaller than the sum of its proper divisors (26253149907).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26238816256 is an frugal number, since it uses more digits than its factorization.
26238816256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5086 (or 2533 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 49.
Multiplying 26238816256 by its sum of digits (49), we get a square (1285701996544 = 11338882).
The spelling of 26238816256 in words is "twenty-six billion, two hundred thirty-eight million, eight hundred sixteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •