Base | Representation |
---|---|
bin | 111101000011001… |
… | …010101000001101 |
3 | 2122101021210100001 |
4 | 331003022220031 |
5 | 4044201141031 |
6 | 245345004301 |
7 | 34244616601 |
oct | 7503125015 |
9 | 2571253301 |
10 | 1024240141 |
11 | 48617a861 |
12 | 247023691 |
13 | 134276572 |
14 | 9a05b501 |
15 | 5edbd861 |
hex | 3d0caa0d |
1024240141 has 4 divisors (see below), whose sum is σ = 1032305152. Its totient is φ = 1016175132.
The previous prime is 1024240127. The next prime is 1024240153. The reversal of 1024240141 is 1410424201.
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 1024240141 - 27 = 1024240013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1024240181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4032315 + ... + 4032568.
It is an arithmetic number, because the mean of its divisors is an integer number (258076288).
Almost surely, 21024240141 is an apocalyptic number.
It is an amenable number.
1024240141 is a deficient number, since it is larger than the sum of its proper divisors (8065011).
1024240141 is an equidigital number, since it uses as much as digits as its factorization.
1024240141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8065010.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 1024240141 is about 32003.7519831660. The cubic root of 1024240141 is about 1008.0156250859.
Adding to 1024240141 its reverse (1410424201), we get a palindrome (2434664342).
It can be divided in two parts, 1024 and 240141, that added together give a triangular number (241165 = T694).
The spelling of 1024240141 in words is "one billion, twenty-four million, two hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •