Base | Representation |
---|---|
bin | 11110111000010111001… |
… | …00010110011100011101 |
3 | 10202102202110122121000121 |
4 | 33130023210112130131 |
5 | 114341013024004410 |
6 | 2131235021154541 |
7 | 136441555460311 |
oct | 17341344263435 |
9 | 3672673577017 |
10 | 1061051000605 |
11 | 379a976a02a2 |
12 | 15177b9bba51 |
13 | 790976ab87b |
14 | 394d8721b41 |
15 | 1c9013c19da |
hex | f70b91671d |
1061051000605 has 4 divisors (see below), whose sum is σ = 1273261200732. Its totient is φ = 848840800480.
The previous prime is 1061051000593. The next prime is 1061051000663. The reversal of 1061051000605 is 5060001501601.
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 713089046916 + 347961953689 = 844446^2 + 589883^2 .
It is not a de Polignac number, because 1061051000605 - 237 = 923612047133 is a prime.
It is a super-2 number, since 2×10610510006052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1061051000605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106105100056 + ... + 106105100065.
It is an arithmetic number, because the mean of its divisors is an integer number (318315300183).
Almost surely, 21061051000605 is an apocalyptic number.
It is an amenable number.
1061051000605 is a deficient number, since it is larger than the sum of its proper divisors (212210200127).
1061051000605 is an equidigital number, since it uses as much as digits as its factorization.
1061051000605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212210200126.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 1061051000605 in words is "one trillion, sixty-one billion, fifty-one million, six hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •