Base | Representation |
---|---|
bin | 1111010010000000… |
… | …1001111111100011 |
3 | 101120212202202111112 |
4 | 3310200021333203 |
5 | 31400112221433 |
6 | 1515013333535 |
7 | 203440010315 |
oct | 36440117743 |
9 | 11525682445 |
10 | 4102070243 |
11 | 181556a0a7 |
12 | 9659372ab |
13 | 504b0b5cb |
14 | 2acb237b5 |
15 | 1901d8348 |
hex | f4809fe3 |
4102070243 has 8 divisors (see below), whose sum is σ = 4164598800. Its totient is φ = 4039580160.
The previous prime is 4102070237. The next prime is 4102070249. The reversal of 4102070243 is 3420702014.
It is an interprime number because it is at equal distance from previous prime (4102070237) and next prime (4102070249).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4102070243 - 26 = 4102070179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4102070249) 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 7 ways as a sum of consecutive naturals, for example, 263723 + ... + 278843.
It is an arithmetic number, because the mean of its divisors is an integer number (520574850).
Almost surely, 24102070243 is an apocalyptic number.
4102070243 is a deficient number, since it is larger than the sum of its proper divisors (62528557).
4102070243 is a wasteful number, since it uses less digits than its factorization.
4102070243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19237.
The product of its (nonzero) digits is 1344, while the sum is 23.
The square root of 4102070243 is about 64047.4062160210. The cubic root of 4102070243 is about 1600.7900060912.
Adding to 4102070243 its reverse (3420702014), we get a palindrome (7522772257).
The spelling of 4102070243 in words is "four billion, one hundred two million, seventy thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •