Base | Representation |
---|---|
bin | 110010011101… |
… | …0010010100000 |
3 | 1211202221220101 |
4 | 1210322102200 |
5 | 23233000102 |
6 | 2342552144 |
7 | 440563615 |
oct | 144722240 |
9 | 54687811 |
10 | 26453152 |
11 | 13a28710 |
12 | 8a38654 |
13 | 563276b |
14 | 372850c |
15 | 24c7e87 |
hex | 193a4a0 |
26453152 has 48 divisors (see below), whose sum is σ = 57238272. Its totient is φ = 11934720.
The previous prime is 26453143. The next prime is 26453171. The reversal of 26453152 is 25135462.
It is a super-3 number, since 3×264531523 (a number of 23 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 26453152.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78328 + ... + 78664.
It is an arithmetic number, because the mean of its divisors is an integer number (1192464).
Almost surely, 226453152 is an apocalyptic number.
26453152 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 26453152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28619136).
26453152 is an abundant number, since it is smaller than the sum of its proper divisors (30785120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26453152 is a wasteful number, since it uses less digits than its factorization.
26453152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581 (or 573 counting only the distinct ones).
The product of its digits is 7200, while the sum is 28.
The square root of 26453152 is about 5143.2627776539. The cubic root of 26453152 is about 297.9608074217.
The spelling of 26453152 in words is "twenty-six million, four hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •