Base | Representation |
---|---|
bin | 110110010010… |
… | …001000001111 |
3 | 222202221221012 |
4 | 312102020033 |
5 | 12120330111 |
6 | 1224555435 |
7 | 231644654 |
oct | 66221017 |
9 | 28687835 |
10 | 14230031 |
11 | 803a262 |
12 | 4922b7b |
13 | 2c4304a |
14 | 1c65c2b |
15 | 13b148b |
hex | d9220f |
14230031 has 8 divisors (see below), whose sum is σ = 15630720. Its totient is φ = 12894552.
The previous prime is 14230001. The next prime is 14230043. The reversal of 14230031 is 13003241.
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 14230031 - 26 = 14229967 is a prime.
It is a super-2 number, since 2×142300312 = 404987564521922, 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 = 14229988 and 14230015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14230001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15845 + ... + 16718.
It is an arithmetic number, because the mean of its divisors is an integer number (1953840).
Almost surely, 214230031 is an apocalyptic number.
14230031 is a deficient number, since it is larger than the sum of its proper divisors (1400689).
14230031 is a wasteful number, since it uses less digits than its factorization.
14230031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32605.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 14230031 is about 3772.2713317045. The cubic root of 14230031 is about 242.3270797571.
Adding to 14230031 its reverse (13003241), we get a palindrome (27233272).
The spelling of 14230031 in words is "fourteen million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •