Base | Representation |
---|---|
bin | 110110011001… |
… | …110010110111 |
3 | 222211120000011 |
4 | 312121302313 |
5 | 12122331211 |
6 | 1225401051 |
7 | 232135342 |
oct | 66316267 |
9 | 28746004 |
10 | 14261431 |
11 | 8060908 |
12 | 4939187 |
13 | 2c54422 |
14 | 1c73459 |
15 | 13ba921 |
hex | d99cb7 |
14261431 has 4 divisors (see below), whose sum is σ = 14297752. Its totient is φ = 14225112.
The previous prime is 14261413. The next prime is 14261437. The reversal of 14261431 is 13416241.
14261431 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13416241 = 29 ⋅462629.
It is a cyclic number.
It is not a de Polignac number, because 14261431 - 221 = 12164279 is a prime.
It is a super-2 number, since 2×142614312 = 406776828335522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14261437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17565 + ... + 18358.
It is an arithmetic number, because the mean of its divisors is an integer number (3574438).
Almost surely, 214261431 is an apocalyptic number.
14261431 is a deficient number, since it is larger than the sum of its proper divisors (36321).
14261431 is an equidigital number, since it uses as much as digits as its factorization.
14261431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36320.
The product of its digits is 576, while the sum is 22.
The square root of 14261431 is about 3776.4309870564. The cubic root of 14261431 is about 242.5051885382.
Adding to 14261431 its reverse (13416241), we get a palindrome (27677672).
The spelling of 14261431 in words is "fourteen million, two hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •