Base | Representation |
---|---|
bin | 111100110110010111… |
… | …0111011011010011100 |
3 | 110111021211210101222100 |
4 | 1321230232323122130 |
5 | 4120104323311223 |
6 | 140010325245100 |
7 | 12304130246022 |
oct | 1715456733234 |
9 | 414254711870 |
10 | 130673260188 |
11 | 50466715509 |
12 | 213aa263790 |
13 | c426510b43 |
14 | 6478a82712 |
15 | 35ec003043 |
hex | 1e6cbbb69c |
130673260188 has 36 divisors (see below), whose sum is σ = 349743139200. Its totient is φ = 40995532416.
The previous prime is 130673260147. The next prime is 130673260199. The reversal of 130673260188 is 881062376031.
130673260188 is a `hidden beast` number, since 1 + 3 + 0 + 6 + 7 + 32 + 601 + 8 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 106758588 + ... + 106759811.
It is an arithmetic number, because the mean of its divisors is an integer number (9715087200).
Almost surely, 2130673260188 is an apocalyptic number.
130673260188 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
130673260188 is an abundant number, since it is smaller than the sum of its proper divisors (219069879012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130673260188 is a wasteful number, since it uses less digits than its factorization.
130673260188 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213518426 (or 213518421 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
The spelling of 130673260188 in words is "one hundred thirty billion, six hundred seventy-three million, two hundred sixty thousand, one hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •