Base | Representation |
---|---|
bin | 1110111110110011… |
… | …1000110011101001 |
3 | 101101021012110120222 |
4 | 3233230320303221 |
5 | 31214002143031 |
6 | 1503015055425 |
7 | 201441240614 |
oct | 35754706351 |
9 | 11337173528 |
10 | 4021521641 |
11 | 1784053805 |
12 | 942971575 |
13 | 4c1218607 |
14 | 2a215717b |
15 | 1880c6e7b |
hex | efb38ce9 |
4021521641 has 4 divisors (see below), whose sum is σ = 4196370432. Its totient is φ = 3846672852.
The previous prime is 4021521607. The next prime is 4021521653. The reversal of 4021521641 is 1461251204.
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-4021521641 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4021521641.
It is not an unprimeable number, because it can be changed into a prime (4021521341) 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, 87424361 + ... + 87424406.
It is an arithmetic number, because the mean of its divisors is an integer number (1049092608).
Almost surely, 24021521641 is an apocalyptic number.
It is an amenable number.
4021521641 is a deficient number, since it is larger than the sum of its proper divisors (174848791).
4021521641 is a wasteful number, since it uses less digits than its factorization.
4021521641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174848790.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 4021521641 is about 63415.4684678746. The cubic root of 4021521641 is about 1590.2429175419.
Adding to 4021521641 its reverse (1461251204), we get a palindrome (5482772845).
The spelling of 4021521641 in words is "four billion, twenty-one million, five hundred twenty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •