Base | Representation |
---|---|
bin | 11110111001011100001… |
… | …10101011011000011101 |
3 | 10202111020211221101022202 |
4 | 33130232012223120131 |
5 | 114343204342041410 |
6 | 2131412320221245 |
7 | 136462122501152 |
oct | 17345606533035 |
9 | 3674224841282 |
10 | 1061630424605 |
11 | 37a264775103 |
12 | 151901a6a825 |
13 | 7915a751aca |
14 | 39551670229 |
15 | 1c9371c7ca5 |
hex | f72e1ab61d |
1061630424605 has 8 divisors (see below), whose sum is σ = 1273968495072. Its totient is φ = 849296349328.
The previous prime is 1061630424601. The next prime is 1061630424607. The reversal of 1061630424605 is 5064240361601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1061630424605 - 22 = 1061630424601 is a prime.
It is a super-2 number, since 2×10616304246052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1061630424601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379259 + ... + 1505688.
It is an arithmetic number, because the mean of its divisors is an integer number (159246061884).
Almost surely, 21061630424605 is an apocalyptic number.
It is an amenable number.
1061630424605 is a deficient number, since it is larger than the sum of its proper divisors (212338070467).
1061630424605 is a wasteful number, since it uses less digits than its factorization.
1061630424605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1997595.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 1061630424605 in words is "one trillion, sixty-one billion, six hundred thirty million, four hundred twenty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •