Base | Representation |
---|---|
bin | 110011100001… |
… | …001010000101 |
3 | 221102010121000 |
4 | 303201022011 |
5 | 11424131112 |
6 | 1201243513 |
7 | 222535431 |
oct | 63411205 |
9 | 27363530 |
10 | 13505157 |
11 | 7694696 |
12 | 4633599 |
13 | 2a4b123 |
14 | 1b179c1 |
15 | 12bb7dc |
hex | ce1285 |
13505157 has 16 divisors (see below), whose sum is σ = 21185280. Its totient is φ = 8473536.
The previous prime is 13505153. The next prime is 13505171. The reversal of 13505157 is 75150531.
13505157 is a `hidden beast` number, since 1 + 3 + 505 + 157 = 666.
It is not a de Polignac number, because 13505157 - 22 = 13505153 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 13505157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13505153) 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, 14253 + ... + 15170.
It is an arithmetic number, because the mean of its divisors is an integer number (1324080).
Almost surely, 213505157 is an apocalyptic number.
13505157 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
13505157 is a deficient number, since it is larger than the sum of its proper divisors (7680123).
13505157 is a wasteful number, since it uses less digits than its factorization.
13505157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29449 (or 29443 counting only the distinct ones).
The product of its (nonzero) digits is 2625, while the sum is 27.
The square root of 13505157 is about 3674.9363259790. The cubic root of 13505157 is about 238.1404732955.
Adding to 13505157 its reverse (75150531), we get a palindrome (88655688).
The spelling of 13505157 in words is "thirteen million, five hundred five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •