Base | Representation |
---|---|
bin | 1111101110110110… |
… | …0001010011111101 |
3 | 101220022100100100011 |
4 | 3323231201103331 |
5 | 32122042423031 |
6 | 1535013503221 |
7 | 206436012403 |
oct | 37355412375 |
9 | 11808310304 |
10 | 4223014141 |
11 | 1877866035 |
12 | 99a341b11 |
13 | 523ba6048 |
14 | 2c0c07473 |
15 | 19ab286b1 |
hex | fbb614fd |
4223014141 has 8 divisors (see below), whose sum is σ = 4269470040. Its totient is φ = 4176698688.
The previous prime is 4223014139. The next prime is 4223014151. The reversal of 4223014141 is 1414103224.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 557196025 + 3665818116 = 23605^2 + 60546^2 .
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 4223014141 - 21 = 4223014139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4223014151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25935 + ... + 95491.
It is an arithmetic number, because the mean of its divisors is an integer number (533683755).
Almost surely, 24223014141 is an apocalyptic number.
It is an amenable number.
4223014141 is a deficient number, since it is larger than the sum of its proper divisors (46455899).
4223014141 is a wasteful number, since it uses less digits than its factorization.
4223014141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70223.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4223014141 is about 64984.7223661069. The cubic root of 4223014141 is about 1616.3702379572.
Adding to 4223014141 its reverse (1414103224), we get a palindrome (5637117365).
The spelling of 4223014141 in words is "four billion, two hundred twenty-three million, fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •