Base | Representation |
---|---|
bin | 1101100111010… |
… | …11110100101101 |
3 | 21221220120121022 |
4 | 12303223310231 |
5 | 213214242031 |
6 | 15155543525 |
7 | 2554534001 |
oct | 663536455 |
9 | 257816538 |
10 | 114212141 |
11 | 595192aa |
12 | 322baba5 |
13 | 1a87b664 |
14 | 11250701 |
15 | a06097b |
hex | 6cebd2d |
114212141 has 4 divisors (see below), whose sum is σ = 116148000. Its totient is φ = 112276284.
The previous prime is 114212107. The next prime is 114212143. The reversal of 114212141 is 141212411.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114212141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114212143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 967841 + ... + 967958.
It is an arithmetic number, because the mean of its divisors is an integer number (29037000).
Almost surely, 2114212141 is an apocalyptic number.
It is an amenable number.
114212141 is a deficient number, since it is larger than the sum of its proper divisors (1935859).
114212141 is an equidigital number, since it uses as much as digits as its factorization.
114212141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1935858.
The product of its digits is 64, while the sum is 17.
The square root of 114212141 is about 10687.0080471571. The cubic root of 114212141 is about 485.1813414770.
Adding to 114212141 its reverse (141212411), we get a palindrome (255424552).
The spelling of 114212141 in words is "one hundred fourteen million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •