Base | Representation |
---|---|
bin | 10111010010010110010110… |
… | …110110011100010001000101 |
3 | 111102121212122221112021111000 |
4 | 113102112112312130101011 |
5 | 101410441010130331302 |
6 | 1001453134533203513 |
7 | 30400212412422330 |
oct | 2722262666342105 |
9 | 442555587467430 |
10 | 102416026027077 |
11 | 2a6a6435791734 |
12 | b5a0ab3a90599 |
13 | 451ba362b53b9 |
14 | 1b40d6804d617 |
15 | bc91210cd31c |
hex | 5d2596d9c445 |
102416026027077 has 64 divisors (see below), whose sum is σ = 179844760453120. Its totient is φ = 56367174628800.
The previous prime is 102416026027069. The next prime is 102416026027087. The reversal of 102416026027077 is 770720620614201.
102416026027077 is a `hidden beast` number, since 1 + 0 + 24 + 16 + 0 + 2 + 602 + 7 + 0 + 7 + 7 = 666.
It is not a de Polignac number, because 102416026027077 - 23 = 102416026027069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102416026027027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40185838 + ... + 42658335.
It is an arithmetic number, because the mean of its divisors is an integer number (2810074382080).
Almost surely, 2102416026027077 is an apocalyptic number.
It is an amenable number.
102416026027077 is a deficient number, since it is larger than the sum of its proper divisors (77428734426043).
102416026027077 is a wasteful number, since it uses less digits than its factorization.
102416026027077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82844431 (or 82844425 counting only the distinct ones).
The product of its (nonzero) digits is 395136, while the sum is 45.
The spelling of 102416026027077 in words is "one hundred two trillion, four hundred sixteen billion, twenty-six million, twenty-seven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •