Base | Representation |
---|---|
bin | 11101101110110111101110… |
… | …000111101010111100101010 |
3 | 122010222221110002222012012210 |
4 | 131232313232013222330222 |
5 | 114114420213211040200 |
6 | 1142040140040545550 |
7 | 36354256422201555 |
oct | 3556675607527452 |
9 | 563887402865183 |
10 | 130764274315050 |
11 | 387358a9919062 |
12 | 127babaaa822b6 |
13 | 57c7030b778bc |
14 | 244104b8b569c |
15 | 101b72b262650 |
hex | 76edee1eaf2a |
130764274315050 has 96 divisors (see below), whose sum is σ = 325358603466624. Its totient is φ = 34756164352000.
The previous prime is 130764274315039. The next prime is 130764274315067. The reversal of 130764274315050 is 50513472467031.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 824739382 + ... + 824897918.
It is an arithmetic number, because the mean of its divisors is an integer number (3389152119444).
Almost surely, 2130764274315050 is an apocalyptic number.
130764274315050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 130764274315050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162679301733312).
130764274315050 is an abundant number, since it is smaller than the sum of its proper divisors (194594329151574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130764274315050 is a wasteful number, since it uses less digits than its factorization.
130764274315050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176544 (or 176539 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 48.
The spelling of 130764274315050 in words is "one hundred thirty trillion, seven hundred sixty-four billion, two hundred seventy-four million, three hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •