Base | Representation |
---|---|
bin | 1101100101110… |
… | …00100100110111 |
3 | 21221111220122212 |
4 | 12302320210313 |
5 | 213141032411 |
6 | 15151244035 |
7 | 2553001010 |
oct | 662704467 |
9 | 257456585 |
10 | 114002231 |
11 | 59395622 |
12 | 3221961b |
13 | 1a806c55 |
14 | 111d8007 |
15 | a01d68b |
hex | 6cb8937 |
114002231 has 4 divisors (see below), whose sum is σ = 130288272. Its totient is φ = 97716192.
The previous prime is 114002227. The next prime is 114002233. The reversal of 114002231 is 132200411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132200411 = 7 ⋅18885773.
It is not a de Polignac number, because 114002231 - 22 = 114002227 is a prime.
It is a super-2 number, since 2×1140022312 = 25993017345954722, 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 (114002233) 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, 8143010 + ... + 8143023.
It is an arithmetic number, because the mean of its divisors is an integer number (32572068).
Almost surely, 2114002231 is an apocalyptic number.
114002231 is a deficient number, since it is larger than the sum of its proper divisors (16286041).
114002231 is an equidigital number, since it uses as much as digits as its factorization.
114002231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16286040.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 114002231 is about 10677.1827276674. The cubic root of 114002231 is about 484.8839216305.
Adding to 114002231 its reverse (132200411), we get a palindrome (246202642).
It can be divided in two parts, 11400 and 2231, that added together give a palindrome (13631).
The spelling of 114002231 in words is "one hundred fourteen million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •