Base | Representation |
---|---|
bin | 1111000011110000… |
… | …0000000000010101 |
3 | 101102201020002221220 |
4 | 3300330000000111 |
5 | 31234304314001 |
6 | 1505035400553 |
7 | 202112435016 |
oct | 36074000025 |
9 | 11381202856 |
10 | 4042260501 |
11 | 1794829164 |
12 | 9498b3159 |
13 | 4c55ca126 |
14 | 2a4bd500d |
15 | 189d21c36 |
hex | f0f00015 |
4042260501 has 4 divisors (see below), whose sum is σ = 5389680672. Its totient is φ = 2694840332.
The previous prime is 4042260457. The next prime is 4042260503. The reversal of 4042260501 is 1050622404.
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 not a de Polignac number, because 4042260501 - 26 = 4042260437 is a prime.
It is a zygodrome in base 4.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4042260503) 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 in 3 ways as a sum of consecutive naturals, for example, 673710081 + ... + 673710086.
It is an arithmetic number, because the mean of its divisors is an integer number (1347420168).
Almost surely, 24042260501 is an apocalyptic number.
It is an amenable number.
4042260501 is a deficient number, since it is larger than the sum of its proper divisors (1347420171).
4042260501 is a wasteful number, since it uses less digits than its factorization.
4042260501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1347420170.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 4042260501 is about 63578.7739815734. The cubic root of 4042260501 is about 1592.9718427320.
Adding to 4042260501 its reverse (1050622404), we get a palindrome (5092882905).
The spelling of 4042260501 in words is "four billion, forty-two million, two hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •