Base | Representation |
---|---|
bin | 11000100100000101… |
… | …000111100100010010 |
3 | 2112002010110012001100 |
4 | 120210011013210102 |
5 | 413004013002031 |
6 | 20041102245230 |
7 | 1622412602640 |
oct | 304405074422 |
9 | 75063405040 |
10 | 26375125266 |
11 | 10205085a96 |
12 | 5140b86816 |
13 | 26443b5ac9 |
14 | 13c2c62190 |
15 | a457a1de6 |
hex | 624147912 |
26375125266 has 96 divisors (see below), whose sum is σ = 66784393728. Its totient is φ = 7366020480.
The previous prime is 26375125261. The next prime is 26375125277. The reversal of 26375125266 is 66252157362.
26375125266 is a `hidden beast` number, since 2 + 6 + 375 + 12 + 5 + 266 = 666.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (26375125261) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 5570236 + ... + 5574968.
It is an arithmetic number, because the mean of its divisors is an integer number (695670768).
Almost surely, 226375125266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26375125266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33392196864).
26375125266 is an abundant number, since it is smaller than the sum of its proper divisors (40409268462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26375125266 is a wasteful number, since it uses less digits than its factorization.
26375125266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5736 (or 5733 counting only the distinct ones).
The product of its digits is 907200, while the sum is 45.
The spelling of 26375125266 in words is "twenty-six billion, three hundred seventy-five million, one hundred twenty-five thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •