Base | Representation |
---|---|
bin | 1111010101000000… |
… | …0010101111010001 |
3 | 101121202101112020210 |
4 | 3311100002233101 |
5 | 31411320422231 |
6 | 1520142354333 |
7 | 203651502465 |
oct | 36520025721 |
9 | 11552345223 |
10 | 4114623441 |
11 | 1821663545 |
12 | 969b8b9a9 |
13 | 5075b5336 |
14 | 2b06704a5 |
15 | 191367a46 |
hex | f5402bd1 |
4114623441 has 8 divisors (see below), whose sum is σ = 5808880224. Its totient is φ = 2581724480.
The previous prime is 4114623391. The next prime is 4114623449. The reversal of 4114623441 is 1443264114.
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 4114623441 - 27 = 4114623313 is a prime.
It is a super-2 number, since 2×41146234412 = 33860252122453360962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4114623399 and 4114623408.
It is not an unprimeable number, because it can be changed into a prime (4114623449) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40339395 + ... + 40339496.
It is an arithmetic number, because the mean of its divisors is an integer number (726110028).
Almost surely, 24114623441 is an apocalyptic number.
It is an amenable number.
4114623441 is a deficient number, since it is larger than the sum of its proper divisors (1694256783).
4114623441 is a wasteful number, since it uses less digits than its factorization.
4114623441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80678911.
The product of its digits is 9216, while the sum is 30.
The square root of 4114623441 is about 64145.3306250736. The cubic root of 4114623441 is about 1602.4212612989.
Adding to 4114623441 its reverse (1443264114), we get a palindrome (5557887555).
The spelling of 4114623441 in words is "four billion, one hundred fourteen million, six hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •