Base | Representation |
---|---|
bin | 100000000001011… |
… | …0000000000010101 |
3 | 2202212210100210100 |
4 | 1000002300000111 |
5 | 4200030301431 |
6 | 254341244313 |
7 | 35424532302 |
oct | 10002600025 |
9 | 2685710710 |
10 | 1074462741 |
11 | 501562840 |
12 | 25ba03699 |
13 | 1417ac091 |
14 | a29b20a9 |
15 | 644de4e6 |
hex | 400b0015 |
1074462741 has 24 divisors (see below), whose sum is σ = 1698259680. Its totient is φ = 649202400.
The previous prime is 1074462737. The next prime is 1074462757. The reversal of 1074462741 is 1472644701.
It is a happy number.
It is not a de Polignac number, because 1074462741 - 22 = 1074462737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1074462696 and 1074462705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1074462761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16375 + ... + 49163.
It is an arithmetic number, because the mean of its divisors is an integer number (70760820).
Almost surely, 21074462741 is an apocalyptic number.
1074462741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1074462741 is a deficient number, since it is larger than the sum of its proper divisors (623796939).
1074462741 is a wasteful number, since it uses less digits than its factorization.
1074462741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33137 (or 33134 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 36.
The square root of 1074462741 is about 32778.9984746331. The cubic root of 1074462741 is about 1024.2291220720.
The spelling of 1074462741 in words is "one billion, seventy-four million, four hundred sixty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •