Base | Representation |
---|---|
bin | 110101100000… |
… | …011000010001 |
3 | 222101121102000 |
4 | 311200120101 |
5 | 12042320012 |
6 | 1220344213 |
7 | 230135610 |
oct | 65403021 |
9 | 28347360 |
10 | 14026257 |
11 | 7a10153 |
12 | 4845069 |
13 | 2ba137b |
14 | 1c11877 |
15 | 1370ddc |
hex | d60611 |
14026257 has 32 divisors (see below), whose sum is σ = 24268800. Its totient is φ = 7839504.
The previous prime is 14026211. The next prime is 14026267. The reversal of 14026257 is 75262041.
14026257 is a `hidden beast` number, since 1 + 402 + 6 + 257 = 666.
14026257 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 14026257 - 210 = 14025233 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 14026257.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14026267) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8094 + ... + 9672.
It is an arithmetic number, because the mean of its divisors is an integer number (758400).
Almost surely, 214026257 is an apocalyptic number.
It is an amenable number.
14026257 is a deficient number, since it is larger than the sum of its proper divisors (10242543).
14026257 is a wasteful number, since it uses less digits than its factorization.
14026257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1642 (or 1636 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 14026257 is about 3745.1644823692. The cubic root of 14026257 is about 241.1648063797.
Adding to 14026257 its reverse (75262041), we get a palindrome (89288298).
The spelling of 14026257 in words is "fourteen million, twenty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •