Base | Representation |
---|---|
bin | 110001101100… |
… | …0010111011001 |
3 | 1211000120201000 |
4 | 1203120113121 |
5 | 23132131212 |
6 | 2330215213 |
7 | 434303343 |
oct | 143302731 |
9 | 54016630 |
10 | 26052057 |
11 | 13784329 |
12 | 8884509 |
13 | 5522025 |
14 | 3662293 |
15 | 24491dc |
hex | 18d85d9 |
26052057 has 16 divisors (see below), whose sum is σ = 38882880. Its totient is φ = 17238816.
The previous prime is 26052029. The next prime is 26052083. The reversal of 26052057 is 75025062.
26052057 is a `hidden beast` number, since 2 + 605 + 2 + 0 + 57 = 666.
It is not a de Polignac number, because 26052057 - 222 = 21857753 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 26052057.
It is not an unprimeable number, because it can be changed into a prime (26052157) 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 15 ways as a sum of consecutive naturals, for example, 178 + ... + 7220.
It is an arithmetic number, because the mean of its divisors is an integer number (2430180).
Almost surely, 226052057 is an apocalyptic number.
26052057 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
26052057 is a deficient number, since it is larger than the sum of its proper divisors (12830823).
26052057 is a wasteful number, since it uses less digits than its factorization.
26052057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7189 (or 7183 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 26052057 is about 5104.1215698688. The cubic root of 26052057 is about 296.4471912600.
The spelling of 26052057 in words is "twenty-six million, fifty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •