Base | Representation |
---|---|
bin | 110100010000… |
… | …110010011101 |
3 | 221210001012210 |
4 | 310100302131 |
5 | 12001402003 |
6 | 1205351033 |
7 | 224310300 |
oct | 64206235 |
9 | 27701183 |
10 | 13700253 |
11 | 7808226 |
12 | 4708479 |
13 | 2ab8b78 |
14 | 1b68b37 |
15 | 1309503 |
hex | d10c9d |
13700253 has 12 divisors (see below), whose sum is σ = 21249600. Its totient is φ = 7828632.
The previous prime is 13700251. The next prime is 13700263. The reversal of 13700253 is 35200731.
It is a happy number.
13700253 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13700253 - 21 = 13700251 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13700251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46453 + ... + 46746.
It is an arithmetic number, because the mean of its divisors is an integer number (1770800).
Almost surely, 213700253 is an apocalyptic number.
It is an amenable number.
13700253 is a deficient number, since it is larger than the sum of its proper divisors (7549347).
13700253 is an equidigital number, since it uses as much as digits as its factorization.
13700253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93216 (or 93209 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 21.
The square root of 13700253 is about 3701.3852812157. The cubic root of 13700253 is about 239.2817240039.
Adding to 13700253 its reverse (35200731), we get a palindrome (48900984).
The spelling of 13700253 in words is "thirteen million, seven hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •