Base | Representation |
---|---|
bin | 111101111010… |
… | …101001100101 |
3 | 1010112121202122 |
4 | 331322221211 |
5 | 13123343023 |
6 | 1335515325 |
7 | 254650511 |
oct | 75725145 |
9 | 33477678 |
10 | 16231013 |
11 | 9186667 |
12 | 5528b45 |
13 | 3493a66 |
14 | 2227141 |
15 | 16592c8 |
hex | f7aa65 |
16231013 has 4 divisors (see below), whose sum is σ = 16300908. Its totient is φ = 16161120.
The previous prime is 16231009. The next prime is 16231021. The reversal of 16231013 is 31013261.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31013261 = 41 ⋅756421.
It can be written as a sum of positive squares in 2 ways, for example, as 1844164 + 14386849 = 1358^2 + 3793^2 .
It is a cyclic number.
It is not a de Polignac number, because 16231013 - 22 = 16231009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16230982 and 16231000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16231043) 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, 34598 + ... + 35063.
It is an arithmetic number, because the mean of its divisors is an integer number (4075227).
Almost surely, 216231013 is an apocalyptic number.
It is an amenable number.
16231013 is a deficient number, since it is larger than the sum of its proper divisors (69895).
16231013 is an equidigital number, since it uses as much as digits as its factorization.
16231013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69894.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 16231013 is about 4028.7731383139. The cubic root of 16231013 is about 253.1911619562.
Adding to 16231013 its reverse (31013261), we get a palindrome (47244274).
The spelling of 16231013 in words is "sixteen million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •