Base | Representation |
---|---|
bin | 11101010100011011101… |
… | …00010011011001000100 |
3 | 10120022021112220222111121 |
4 | 32222031310103121010 |
5 | 113001124310130021 |
6 | 2050443253243324 |
7 | 132532231462561 |
oct | 16521564233104 |
9 | 3508245828447 |
10 | 1007401645636 |
11 | 359266a69901 |
12 | 1432a8933544 |
13 | 73cc786b109 |
14 | 36a89475868 |
15 | 1b31146b741 |
hex | ea8dd13644 |
1007401645636 has 81 divisors (see below), whose sum is σ = 1896004194903. Its totient is φ = 468283472640.
The previous prime is 1007401645609. The next prime is 1007401645637. The reversal of 1007401645636 is 6365461047001.
The square root of 1007401645636 is 1003694.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 756256336900 + 251145308736 = 869630^2 + 501144^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1007401645592 and 1007401645601.
It is not an unprimeable number, because it can be changed into a prime (1007401645637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2326562476 + ... + 2326562908.
Almost surely, 21007401645636 is an apocalyptic number.
1007401645636 is the 1003694-th square number.
It is an amenable number.
1007401645636 is a deficient number, since it is larger than the sum of its proper divisors (888602549267).
1007401645636 is an frugal number, since it uses more digits than its factorization.
1007401645636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030 (or 515 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 1007401645636 in words is "one trillion, seven billion, four hundred one million, six hundred forty-five thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •