Base | Representation |
---|---|
bin | 11110100110110111110… |
… | …00111110011110100101 |
3 | 10201112112002000121011010 |
4 | 33103123320332132211 |
5 | 114212300224312001 |
6 | 2123043152332433 |
7 | 135660100264551 |
oct | 17233370763645 |
9 | 3645462017133 |
10 | 1051661166501 |
11 | 376009347a20 |
12 | 14b99b244119 |
13 | 7822c23920a |
14 | 38c87630861 |
15 | 1c551d8d8d6 |
hex | f4dbe3e7a5 |
1051661166501 has 32 divisors (see below), whose sum is σ = 1533132582912. Its totient is φ = 635936250560.
The previous prime is 1051661166487. The next prime is 1051661166539. The reversal of 1051661166501 is 1056611661501.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1051661166501 is a prime.
It is a super-2 number, since 2×10516611665012 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1051661166501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1051661162501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 97978531 + ... + 97989263.
It is an arithmetic number, because the mean of its divisors is an integer number (47910393216).
Almost surely, 21051661166501 is an apocalyptic number.
1051661166501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1051661166501 is a deficient number, since it is larger than the sum of its proper divisors (481471416411).
1051661166501 is a wasteful number, since it uses less digits than its factorization.
1051661166501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17153.
The product of its (nonzero) digits is 32400, while the sum is 39.
The spelling of 1051661166501 in words is "one trillion, fifty-one billion, six hundred sixty-one million, one hundred sixty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •