Base | Representation |
---|---|
bin | 110001110101… |
… | …1110001001010 |
3 | 1211011121201110 |
4 | 1203223301022 |
5 | 23142202110 |
6 | 2332031150 |
7 | 435054135 |
oct | 143536112 |
9 | 54147643 |
10 | 26131530 |
11 | 13829007 |
12 | 89024b6 |
13 | 554c259 |
14 | 368321c |
15 | 2462a20 |
hex | 18ebc4a |
26131530 has 64 divisors (see below), whose sum is σ = 65691648. Its totient is φ = 6646080.
The previous prime is 26131507. The next prime is 26131537. The reversal of 26131530 is 3513162.
It is a junction number, because it is equal to n+sod(n) for n = 26131497 and 26131506.
It is not an unprimeable number, because it can be changed into a prime (26131537) 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 31 ways as a sum of consecutive naturals, for example, 60415 + ... + 60845.
It is an arithmetic number, because the mean of its divisors is an integer number (1026432).
Almost surely, 226131530 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26131530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32845824).
26131530 is an abundant number, since it is smaller than the sum of its proper divisors (39560118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26131530 is a wasteful number, since it uses less digits than its factorization.
26131530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 26131530 is about 5111.9008206341. The cubic root of 26131530 is about 296.7483271953.
Adding to 26131530 its reverse (3513162), we get a palindrome (29644692).
The spelling of 26131530 in words is "twenty-six million, one hundred thirty-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •