Base | Representation |
---|---|
bin | 11101101110010011101010… |
… | …011001101001010110000110 |
3 | 122010212020111211220121020112 |
4 | 131232103222121221112012 |
5 | 114113301420121300200 |
6 | 1142010254131033022 |
7 | 36351416113230656 |
oct | 3556235231512606 |
9 | 563766454817215 |
10 | 130725557212550 |
11 | 38720441046993 |
12 | 127b35a473b772 |
13 | 57c34a08229b1 |
14 | 243d217856366 |
15 | 101a7121dd535 |
hex | 76e4ea669586 |
130725557212550 has 24 divisors (see below), whose sum is σ = 243149841152256. Its totient is φ = 52290157350240.
The previous prime is 130725557212517. The next prime is 130725557212609. The reversal of 130725557212550 is 55212755527031.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 67762619 + ... + 69665081.
It is an arithmetic number, because the mean of its divisors is an integer number (10131243381344).
Almost surely, 2130725557212550 is an apocalyptic number.
130725557212550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130725557212550 is a deficient number, since it is larger than the sum of its proper divisors (112424283939706).
130725557212550 is a wasteful number, since it uses less digits than its factorization.
130725557212550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276752 (or 3276747 counting only the distinct ones).
The product of its (nonzero) digits is 3675000, while the sum is 50.
The spelling of 130725557212550 in words is "one hundred thirty trillion, seven hundred twenty-five billion, five hundred fifty-seven million, two hundred twelve thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •