Base | Representation |
---|---|
bin | 111011011000… |
… | …0001010011101 |
3 | 2011120120200221 |
4 | 1312300022131 |
5 | 30432132034 |
6 | 3031121341 |
7 | 525413542 |
oct | 166601235 |
9 | 64516627 |
10 | 31130269 |
11 | 166326a5 |
12 | a513251 |
13 | 65ac5a1 |
14 | 41c4bc9 |
15 | 2aedbb4 |
hex | 1db029d |
31130269 has 4 divisors (see below), whose sum is σ = 31147200. Its totient is φ = 31113340.
The previous prime is 31130261. The next prime is 31130273. The reversal of 31130269 is 96203113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96203113 = 2239 ⋅42967.
It is a cyclic number.
It is not a de Polignac number, because 31130269 - 23 = 31130261 is a prime.
It is a super-2 number, since 2×311302692 = 1938187296024722, 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 (31130261) 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, 5317 + ... + 9514.
It is an arithmetic number, because the mean of its divisors is an integer number (7786800).
Almost surely, 231130269 is an apocalyptic number.
It is an amenable number.
31130269 is a deficient number, since it is larger than the sum of its proper divisors (16931).
31130269 is a wasteful number, since it uses less digits than its factorization.
31130269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16930.
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 31130269 is about 5579.4506001935. The cubic root of 31130269 is about 314.5774766722.
The spelling of 31130269 in words is "thirty-one million, one hundred thirty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •