Base | Representation |
---|---|
bin | 10111001110110010001110… |
… | …101010110110001001010011 |
3 | 111101202110101221011000111000 |
4 | 113032302032222312021103 |
5 | 101342432330330234442 |
6 | 1001144424424153043 |
7 | 30343421333426031 |
oct | 2716621652661123 |
9 | 441673357130430 |
10 | 102171075633747 |
11 | 2a61156766773a |
12 | b561532608783 |
13 | 45018ca433463 |
14 | 1b3316c133551 |
15 | bc2a86768d4c |
hex | 5cec8eab6253 |
102171075633747 has 32 divisors (see below), whose sum is σ = 153891562045760. Its totient is φ = 66977560143360.
The previous prime is 102171075633659. The next prime is 102171075633811. The reversal of 102171075633747 is 747336570171201.
102171075633747 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 7 + 1 + 0 + 7 + 563 + 3 + 74 + 7 = 666.
It is not a de Polignac number, because 102171075633747 - 220 = 102171074585171 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102171075633693 and 102171075633702.
It is not an unprimeable number, because it can be changed into a prime (102171075633047) 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, 3640438 + ... + 14751099.
It is an arithmetic number, because the mean of its divisors is an integer number (4809111313930).
Almost surely, 2102171075633747 is an apocalyptic number.
102171075633747 is a deficient number, since it is larger than the sum of its proper divisors (51720486412013).
102171075633747 is a wasteful number, since it uses less digits than its factorization.
102171075633747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18394980 (or 18394974 counting only the distinct ones).
The product of its (nonzero) digits is 5186160, while the sum is 54.
The spelling of 102171075633747 in words is "one hundred two trillion, one hundred seventy-one billion, seventy-five million, six hundred thirty-three thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •