Base | Representation |
---|---|
bin | 110010001011… |
… | …1011000001000 |
3 | 1211111200202002 |
4 | 1210113120020 |
5 | 23213411102 |
6 | 2335530132 |
7 | 436426661 |
oct | 144273010 |
9 | 54450662 |
10 | 26310152 |
11 | 13940230 |
12 | 8989948 |
13 | 55b264b |
14 | 36cc368 |
15 | 249a902 |
hex | 1917608 |
26310152 has 64 divisors (see below), whose sum is σ = 58449600. Its totient is φ = 10967040.
The previous prime is 26310143. The next prime is 26310157. The reversal of 26310152 is 25101362.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26310157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64124 + ... + 64532.
It is an arithmetic number, because the mean of its divisors is an integer number (913275).
Almost surely, 226310152 is an apocalyptic number.
26310152 is a gapful number since it is divisible by the number (22) 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 26310152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29224800).
26310152 is an abundant number, since it is smaller than the sum of its proper divisors (32139448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26310152 is a wasteful number, since it uses less digits than its factorization.
26310152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486 (or 482 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 26310152 is about 5129.3422580288. The cubic root of 26310152 is about 297.4229332190.
It can be divided in two parts, 26310 and 152, that added together give a palindrome (26462).
The spelling of 26310152 in words is "twenty-six million, three hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.305 sec. • engine limits •