Base | Representation |
---|---|
bin | 11101101011111111010110… |
… | …111000110100110100100110 |
3 | 122010022000111001120110221011 |
4 | 131223333112320310310212 |
5 | 114103144303402124000 |
6 | 1141405200524212434 |
7 | 36334051012546645 |
oct | 3553772670646446 |
9 | 563260431513834 |
10 | 130566316051750 |
11 | 38669955610967 |
12 | 1278876309a11a |
13 | 57b1473856c67 |
14 | 243562ca3535c |
15 | 10164e21972ba |
hex | 76bfd6e34d26 |
130566316051750 has 64 divisors (see below), whose sum is σ = 251097897960000. Its totient is φ = 50800463366400.
The previous prime is 130566316051723. The next prime is 130566316051751. The reversal of 130566316051750 is 57150613665031.
It is a junction number, because it is equal to n+sod(n) for n = 130566316051694 and 130566316051703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130566316051751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30348706 + ... + 34382794.
It is an arithmetic number, because the mean of its divisors is an integer number (3923404655625).
Almost surely, 2130566316051750 is an apocalyptic number.
130566316051750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130566316051750 is a deficient number, since it is larger than the sum of its proper divisors (120531581908250).
130566316051750 is a wasteful number, since it uses less digits than its factorization.
130566316051750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4037642 (or 4037632 counting only the distinct ones).
The product of its (nonzero) digits is 1701000, while the sum is 49.
The spelling of 130566316051750 in words is "one hundred thirty trillion, five hundred sixty-six billion, three hundred sixteen million, fifty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •