Base | Representation |
---|---|
bin | 11000001110110010001… |
… | …010111001110001110101 |
3 | 12220012000120120220000212 |
4 | 120032302022321301311 |
5 | 204240202213433401 |
6 | 3312542214115205 |
7 | 231205521416045 |
oct | 30166212716165 |
9 | 5805016526025 |
10 | 1665141546101 |
11 | 592200aa1200 |
12 | 22a87064bb05 |
13 | c1039940aa7 |
14 | 5a843d69725 |
15 | 2d4aa3ecdbb |
hex | 183b22b9c75 |
1665141546101 has 6 divisors (see below), whose sum is σ = 1830279550806. Its totient is φ = 1513765041800.
The previous prime is 1665141546091. The next prime is 1665141546119. The reversal of 1665141546101 is 1016451415661.
It can be written as a sum of positive squares in only one way, i.e., 1575027510001 + 90114036100 = 1255001^2 + 300190^2 .
It is not a de Polignac number, because 1665141546101 - 214 = 1665141529717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1665141546181) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6880750070 + ... + 6880750311.
It is an arithmetic number, because the mean of its divisors is an integer number (305046591801).
Almost surely, 21665141546101 is an apocalyptic number.
1665141546101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1665141546101 is a deficient number, since it is larger than the sum of its proper divisors (165138004705).
1665141546101 is a wasteful number, since it uses less digits than its factorization.
1665141546101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13761500403 (or 13761500392 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 41.
The spelling of 1665141546101 in words is "one trillion, six hundred sixty-five billion, one hundred forty-one million, five hundred forty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •