Base | Representation |
---|---|
bin | 110101100001… |
… | …101100001111 |
3 | 222101212210001 |
4 | 311201230033 |
5 | 12043003011 |
6 | 1220425131 |
7 | 230160355 |
oct | 65415417 |
9 | 28355701 |
10 | 14031631 |
11 | 7a14199 |
12 | 48481a7 |
13 | 2ba3953 |
14 | 1c137d5 |
15 | 13727c1 |
hex | d61b0f |
14031631 has 8 divisors (see below), whose sum is σ = 14446080. Its totient is φ = 13621272.
The previous prime is 14031629. The next prime is 14031637. The reversal of 14031631 is 13613041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14031631 - 21 = 14031629 is a prime.
It is a super-2 number, since 2×140316312 = 393773337040322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14031599 and 14031608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14031637) 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 7 ways as a sum of consecutive naturals, for example, 6786 + ... + 8608.
It is an arithmetic number, because the mean of its divisors is an integer number (1805760).
Almost surely, 214031631 is an apocalyptic number.
14031631 is a deficient number, since it is larger than the sum of its proper divisors (414449).
14031631 is a wasteful number, since it uses less digits than its factorization.
14031631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2045.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 14031631 is about 3745.8818721364. The cubic root of 14031631 is about 241.1956022931.
Adding to 14031631 its reverse (13613041), we get a palindrome (27644672).
The spelling of 14031631 in words is "fourteen million, thirty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •