Base | Representation |
---|---|
bin | 1000000000110001… |
… | …01100100001011010 |
3 | 102002202220211220212 |
4 | 10000120230201122 |
5 | 32302132103424 |
6 | 1550454451122 |
7 | 211410434435 |
oct | 40030544132 |
9 | 12082824825 |
10 | 4301441114 |
11 | 1908062413 |
12 | a00663aa2 |
13 | 537205439 |
14 | 2cb3c081c |
15 | 1a296b10e |
hex | 10062c85a |
4301441114 has 4 divisors (see below), whose sum is σ = 6452161674. Its totient is φ = 2150720556.
The previous prime is 4301441087. The next prime is 4301441119. The reversal of 4301441114 is 4111441034.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 4111441034 = 2 ⋅2055720517.
It can be written as a sum of positive squares in only one way, i.e., 2394634225 + 1906806889 = 48935^2 + 43667^2 .
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4301441114.
It is not an unprimeable number, because it can be changed into a prime (4301441119) 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 as a sum of consecutive naturals, namely, 1075360277 + ... + 1075360280.
Almost surely, 24301441114 is an apocalyptic number.
4301441114 is a deficient number, since it is larger than the sum of its proper divisors (2150720560).
4301441114 is a wasteful number, since it uses less digits than its factorization.
4301441114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2150720559.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 4301441114 is about 65585.3727137385. The cubic root of 4301441114 is about 1626.3149736763.
Adding to 4301441114 its reverse (4111441034), we get a palindrome (8412882148).
The spelling of 4301441114 in words is "four billion, three hundred one million, four hundred forty-one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •