Base | Representation |
---|---|
bin | 111100010100100… |
… | …100010010010101 |
3 | 2121112022011120202 |
4 | 330110210102111 |
5 | 4033034240334 |
6 | 244231110245 |
7 | 34036031441 |
oct | 7424442225 |
9 | 2545264522 |
10 | 1012024469 |
11 | 47a296a65 |
12 | 242b12385 |
13 | 13188a361 |
14 | 9859b821 |
15 | 5dca917e |
hex | 3c524495 |
1012024469 has 2 divisors, whose sum is σ = 1012024470. Its totient is φ = 1012024468.
The previous prime is 1012024451. The next prime is 1012024547. The reversal of 1012024469 is 9644202101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 747311569 + 264712900 = 27337^2 + 16270^2 .
It is an emirp because it is prime and its reverse (9644202101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1012024469 - 220 = 1010975893 is a prime.
It is a super-2 number, since 2×10120244692 = 2048387051709463922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012024439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506012234 + 506012235.
It is an arithmetic number, because the mean of its divisors is an integer number (506012235).
Almost surely, 21012024469 is an apocalyptic number.
It is an amenable number.
1012024469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012024469 is an equidigital number, since it uses as much as digits as its factorization.
1012024469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 1012024469 is about 31812.3320270615. The cubic root of 1012024469 is about 1003.9921974838.
The spelling of 1012024469 in words is "one billion, twelve million, twenty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •