Base | Representation |
---|---|
bin | 1111000011101111… |
… | …0001011110101001 |
3 | 101102201010002100012 |
4 | 3300323301132221 |
5 | 31234300413001 |
6 | 1505034221305 |
7 | 202112066366 |
oct | 36073613651 |
9 | 11381102305 |
10 | 4042201001 |
11 | 1794798493 |
12 | 949884835 |
13 | 4c55a9017 |
14 | 2a4bbb46d |
15 | 189d0e2bb |
hex | f0ef17a9 |
4042201001 has 4 divisors (see below), whose sum is σ = 4042674900. Its totient is φ = 4041727104.
The previous prime is 4042200997. The next prime is 4042201003. The reversal of 4042201001 is 1001022404.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3814915225 + 227285776 = 61765^2 + 15076^2 .
It is a cyclic number.
It is not a de Polignac number, because 4042201001 - 22 = 4042200997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4042201003) 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, 223916 + ... + 241293.
It is an arithmetic number, because the mean of its divisors is an integer number (1010668725).
Almost surely, 24042201001 is an apocalyptic number.
It is an amenable number.
4042201001 is a deficient number, since it is larger than the sum of its proper divisors (473899).
4042201001 is an equidigital number, since it uses as much as digits as its factorization.
4042201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473898.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 4042201001 is about 63578.3060563900. The cubic root of 4042201001 is about 1592.9640267843.
Adding to 4042201001 its reverse (1001022404), we get a palindrome (5043223405).
The spelling of 4042201001 in words is "four billion, forty-two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •