Base | Representation |
---|---|
bin | 11110111110110111010101… |
… | …00101111000110001010110 |
3 | 22221020020021010011000010000 |
4 | 33133123222211320301112 |
5 | 32412223142001041213 |
6 | 400522451552112130 |
7 | 20231165301514206 |
oct | 1737335245706126 |
9 | 287206233130100 |
10 | 68130707049558 |
11 | 1a788085a6924a |
12 | 778422bb35646 |
13 | 2c0290c98419a |
14 | 12b7788332406 |
15 | 7d2381992c73 |
hex | 3df6ea978c56 |
68130707049558 has 80 divisors (see below), whose sum is σ = 164293335116064. Its totient is φ = 21023940407040.
The previous prime is 68130707049551. The next prime is 68130707049583. The reversal of 68130707049558 is 85594070703186.
68130707049558 is a `hidden beast` number, since 6 + 8 + 1 + 3 + 0 + 7 + 0 + 70 + 4 + 9 + 558 = 666.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 68130707049495 and 68130707049504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68130707049551) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 202609210 + ... + 202945197.
Almost surely, 268130707049558 is an apocalyptic number.
68130707049558 is an abundant number, since it is smaller than the sum of its proper divisors (96162628066506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68130707049558 is a wasteful number, since it uses less digits than its factorization.
68130707049558 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405554499 (or 405554490 counting only the distinct ones).
The product of its (nonzero) digits is 50803200, while the sum is 63.
The spelling of 68130707049558 in words is "sixty-eight trillion, one hundred thirty billion, seven hundred seven million, forty-nine thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •