Base | Representation |
---|---|
bin | 1110111010001011… |
… | …1000011000011011 |
3 | 101022220200211020201 |
4 | 3232202320120123 |
5 | 31144020334433 |
6 | 1501043203031 |
7 | 201114316651 |
oct | 35642703033 |
9 | 11286624221 |
10 | 4002121243 |
11 | 1774102a1a |
12 | 938376477 |
13 | 4ba1b50a3 |
14 | 29d746dd1 |
15 | 186543a7d |
hex | ee8b861b |
4002121243 has 4 divisors (see below), whose sum is σ = 4110286720. Its totient is φ = 3893955768.
The previous prime is 4002121237. The next prime is 4002121301. The reversal of 4002121243 is 3421212004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4002121243 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 4002121243.
It is not an unprimeable number, because it can be changed into a prime (4002121043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54082683 + ... + 54082756.
It is an arithmetic number, because the mean of its divisors is an integer number (1027571680).
Almost surely, 24002121243 is an apocalyptic number.
4002121243 is a deficient number, since it is larger than the sum of its proper divisors (108165477).
4002121243 is a wasteful number, since it uses less digits than its factorization.
4002121243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108165476.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 4002121243 is about 63262.3208790193. The cubic root of 4002121243 is about 1587.6816076609.
Adding to 4002121243 its reverse (3421212004), we get a palindrome (7423333247).
The spelling of 4002121243 in words is "four billion, two million, one hundred twenty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •