Base | Representation |
---|---|
bin | 110100001001110111110… |
… | …1101001111101010110100 |
3 | 221101020221010112021111100 |
4 | 1220103233231033222310 |
5 | 1414420104412040022 |
6 | 23124540212410100 |
7 | 1336605251516262 |
oct | 150235755175264 |
9 | 27336833467440 |
10 | 7168027065012 |
11 | 2313a41454230 |
12 | 979265916930 |
13 | 3ccc328c3458 |
14 | 1aad11c5b432 |
15 | c66cbc311ac |
hex | 684efb4fab4 |
7168027065012 has 36 divisors (see below), whose sum is σ = 19766377665216. Its totient is φ = 2172129413520.
The previous prime is 7168027064999. The next prime is 7168027065013. The reversal of 7168027065012 is 2105607208617.
7168027065012 is a `hidden beast` number, since 71 + 6 + 8 + 0 + 2 + 70 + 6 + 501 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×71680270650122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7168027065013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9050538828 + ... + 9050539619.
It is an arithmetic number, because the mean of its divisors is an integer number (549066046256).
Almost surely, 27168027065012 is an apocalyptic number.
It is an amenable number.
7168027065012 is an abundant number, since it is smaller than the sum of its proper divisors (12598350600204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7168027065012 is a wasteful number, since it uses less digits than its factorization.
7168027065012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18101078468 (or 18101078463 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 45.
The spelling of 7168027065012 in words is "seven trillion, one hundred sixty-eight billion, twenty-seven million, sixty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •