Base | Representation |
---|---|
bin | 1111011001001001… |
… | …0111110110110001 |
3 | 101122222002221002210 |
4 | 3312102113312301 |
5 | 31430243331231 |
6 | 1522003202333 |
7 | 204252342405 |
oct | 36622276661 |
9 | 11588087083 |
10 | 4132011441 |
11 | 183045a398 |
12 | 9739763a9 |
13 | 50b0928ac |
14 | 2b2ab9105 |
15 | 192b4ea46 |
hex | f6497db1 |
4132011441 has 4 divisors (see below), whose sum is σ = 5509348592. Its totient is φ = 2754674292.
The previous prime is 4132011431. The next prime is 4132011461. The reversal of 4132011441 is 1441102314.
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 not a de Polignac number, because 4132011441 - 25 = 4132011409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4132011431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 688668571 + ... + 688668576.
It is an arithmetic number, because the mean of its divisors is an integer number (1377337148).
Almost surely, 24132011441 is an apocalyptic number.
It is an amenable number.
4132011441 is a deficient number, since it is larger than the sum of its proper divisors (1377337151).
4132011441 is a wasteful number, since it uses less digits than its factorization.
4132011441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377337150.
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 4132011441 is about 64280.7237124785. The cubic root of 4132011441 is about 1604.6753148015.
Adding to 4132011441 its reverse (1441102314), we get a palindrome (5573113755).
The spelling of 4132011441 in words is "four billion, one hundred thirty-two million, eleven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •