Base | Representation |
---|---|
bin | 111100011010110… |
… | …111001111000001 |
3 | 2121122102000121111 |
4 | 330122313033001 |
5 | 4034000044240 |
6 | 244330323321 |
7 | 34056044353 |
oct | 7432671701 |
9 | 2548360544 |
10 | 1013674945 |
11 | 480213a98 |
12 | 243589541 |
13 | 13201767a |
14 | 988ab0d3 |
15 | 5ded31ea |
hex | 3c6b73c1 |
1013674945 has 4 divisors (see below), whose sum is σ = 1216409940. Its totient is φ = 810939952.
The previous prime is 1013674943. The next prime is 1013674951. The reversal of 1013674945 is 5494763101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 181467841 + 832207104 = 13471^2 + 28848^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013674945 - 21 = 1013674943 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013674898 and 1013674907.
It is not an unprimeable number, because it can be changed into a prime (1013674943) 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 in 3 ways as a sum of consecutive naturals, for example, 101367490 + ... + 101367499.
It is an arithmetic number, because the mean of its divisors is an integer number (304102485).
Almost surely, 21013674945 is an apocalyptic number.
It is an amenable number.
1013674945 is a deficient number, since it is larger than the sum of its proper divisors (202734995).
1013674945 is an equidigital number, since it uses as much as digits as its factorization.
1013674945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202734994.
The product of its (nonzero) digits is 90720, while the sum is 40.
The square root of 1013674945 is about 31838.2622798418. The cubic root of 1013674945 is about 1004.5376931958.
The spelling of 1013674945 in words is "one billion, thirteen million, six hundred seventy-four thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •