Base | Representation |
---|---|
bin | 11101101101110011010100… |
… | …001011111101001001111000 |
3 | 122010201220212021201112211110 |
4 | 131231303110023331021320 |
5 | 114112214302121132202 |
6 | 1141542311442400320 |
7 | 36346046320412532 |
oct | 3555632413751170 |
9 | 563656767645743 |
10 | 130690824786552 |
11 | 38707738542198 |
12 | 127a89109600a0 |
13 | 57c0126b85834 |
14 | 243b680abc852 |
15 | 101987cdb426c |
hex | 76dcd42fd278 |
130690824786552 has 32 divisors (see below), whose sum is σ = 334325365735680. Its totient is φ = 42550501092960.
The previous prime is 130690824786517. The next prime is 130690824786617. The reversal of 130690824786552 is 255687428096031.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63319197024 + ... + 63319199087.
It is an arithmetic number, because the mean of its divisors is an integer number (10447667679240).
It is a 2-persistent number, because it is pandigital, and so is 2⋅130690824786552 = 261381649573104, but 3⋅130690824786552 = 392072474359656 is not.
Almost surely, 2130690824786552 is an apocalyptic number.
130690824786552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130690824786552 is an abundant number, since it is smaller than the sum of its proper divisors (203634540949128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130690824786552 is a wasteful number, since it uses less digits than its factorization.
130690824786552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126638396163 (or 126638396159 counting only the distinct ones).
The product of its (nonzero) digits is 174182400, while the sum is 66.
The spelling of 130690824786552 in words is "one hundred thirty trillion, six hundred ninety billion, eight hundred twenty-four million, seven hundred eighty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •