Base | Representation |
---|---|
bin | 10100000110111001110… |
… | …110000000111101000101 |
3 | 11220002200012002022012212 |
4 | 110012321312000331011 |
5 | 140114412411243121 |
6 | 2534442525553205 |
7 | 201555232000460 |
oct | 24067166007505 |
9 | 4802605068185 |
10 | 1381802446661 |
11 | 49302350410a |
12 | 1a3976a15805 |
13 | a03c3797b30 |
14 | 4ac458762d7 |
15 | 25e2578225b |
hex | 141b9d80f45 |
1381802446661 has 16 divisors (see below), whose sum is σ = 1724633180928. Its totient is φ = 1077895728000.
The previous prime is 1381802446649. The next prime is 1381802446691. The reversal of 1381802446661 is 1666442081831.
It is not a de Polignac number, because 1381802446661 - 26 = 1381802446597 is a prime.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1381802446691) 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 15 ways as a sum of consecutive naturals, for example, 106927640 + ... + 106940561.
It is an arithmetic number, because the mean of its divisors is an integer number (107789573808).
Almost surely, 21381802446661 is an apocalyptic number.
It is an amenable number.
1381802446661 is a deficient number, since it is larger than the sum of its proper divisors (342830734267).
1381802446661 is a wasteful number, since it uses less digits than its factorization.
1381802446661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213868292.
The product of its (nonzero) digits is 1327104, while the sum is 50.
The spelling of 1381802446661 in words is "one trillion, three hundred eighty-one billion, eight hundred two million, four hundred forty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •