Base | Representation |
---|---|
bin | 101010011010111001111 |
3 | 2121121202122 |
4 | 11103113033 |
5 | 323440111 |
6 | 45443155 |
7 | 14546366 |
oct | 5232717 |
9 | 2547678 |
10 | 1390031 |
11 | 86a395 |
12 | 5704bb |
13 | 398906 |
14 | 2827dd |
15 | 1c6cdb |
hex | 1535cf |
1390031 has 4 divisors (see below), whose sum is σ = 1416312. Its totient is φ = 1363752.
The previous prime is 1390027. The next prime is 1390043. The reversal of 1390031 is 1300931.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1390031 - 22 = 1390027 is a prime.
It is a super-2 number, since 2×13900312 = 3864372361922, 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 = 1389991 and 1390009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1390331) 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 3 ways as a sum of consecutive naturals, for example, 13061 + ... + 13166.
It is an arithmetic number, because the mean of its divisors is an integer number (354078).
21390031 is an apocalyptic number.
1390031 is a deficient number, since it is larger than the sum of its proper divisors (26281).
1390031 is an equidigital number, since it uses as much as digits as its factorization.
1390031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26280.
The product of its (nonzero) digits is 81, while the sum is 17.
The square root of 1390031 is about 1178.9957591103. The cubic root of 1390031 is about 111.6027326404.
Adding to 1390031 its reverse (1300931), we get a palindrome (2690962).
It can be divided in two parts, 13900 and 31, that added together give a palindrome (13931).
The spelling of 1390031 in words is "one million, three hundred ninety thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •