Base | Representation |
---|---|
bin | 1111010110010101… |
… | …1110101101100001 |
3 | 101122010222000220010 |
4 | 3311211132231201 |
5 | 31414240234131 |
6 | 1520503035133 |
7 | 204050326245 |
oct | 36545365541 |
9 | 11563860803 |
10 | 4120243041 |
11 | 1824851642 |
12 | 96ba3baa9 |
13 | 508802145 |
14 | 2b12d4425 |
15 | 191ac7b46 |
hex | f595eb61 |
4120243041 has 8 divisors (see below), whose sum is σ = 5494421664. Its totient is φ = 2746446560.
The previous prime is 4120243031. The next prime is 4120243067. The reversal of 4120243041 is 1403420214.
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 4120243041 - 215 = 4120210273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4120242999 and 4120243017.
It is not an unprimeable number, because it can be changed into a prime (4120243031) 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 7 ways as a sum of consecutive naturals, for example, 69351 + ... + 114236.
It is an arithmetic number, because the mean of its divisors is an integer number (686802708).
Almost surely, 24120243041 is an apocalyptic number.
It is an amenable number.
4120243041 is a deficient number, since it is larger than the sum of its proper divisors (1374178623).
4120243041 is a wasteful number, since it uses less digits than its factorization.
4120243041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191071.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 4120243041 is about 64189.1193349776. The cubic root of 4120243041 is about 1603.1504386024.
Adding to 4120243041 its reverse (1403420214), we get a palindrome (5523663255).
The spelling of 4120243041 in words is "four billion, one hundred twenty million, two hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •