Base | Representation |
---|---|
bin | 111101000101101… |
… | …010010010111101 |
3 | 2122102112000110021 |
4 | 331011222102331 |
5 | 4044333103031 |
6 | 245411012141 |
7 | 34253312365 |
oct | 7505522275 |
9 | 2572460407 |
10 | 1024894141 |
11 | 486587157 |
12 | 24729a051 |
13 | 13444514b |
14 | 9a18b9a5 |
15 | 5ee9c511 |
hex | 3d16a4bd |
1024894141 has 2 divisors, whose sum is σ = 1024894142. Its totient is φ = 1024894140.
The previous prime is 1024894127. The next prime is 1024894163. The reversal of 1024894141 is 1414984201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1020546916 + 4347225 = 31946^2 + 2085^2 .
It is a cyclic number.
It is not a de Polignac number, because 1024894141 - 215 = 1024861373 is a prime.
It is a super-2 number, since 2×10248941412 = 2100816000512255762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1024894097 and 1024894106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1024894111) 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 as a sum of consecutive naturals, namely, 512447070 + 512447071.
It is an arithmetic number, because the mean of its divisors is an integer number (512447071).
Almost surely, 21024894141 is an apocalyptic number.
It is an amenable number.
1024894141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1024894141 is an equidigital number, since it uses as much as digits as its factorization.
1024894141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 34.
The square root of 1024894141 is about 32013.9679046506. The cubic root of 1024894141 is about 1008.2301262003.
The spelling of 1024894141 in words is "one billion, twenty-four million, eight hundred ninety-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •