Base | Representation |
---|---|
bin | 11101100011110010011010… |
… | …101111101011101111110110 |
3 | 122001022010121100010200202021 |
4 | 131203302122233223233312 |
5 | 114014430430033302200 |
6 | 1140254222254103354 |
7 | 36245245156014112 |
oct | 3543623257535766 |
9 | 561263540120667 |
10 | 130002666306550 |
11 | 38471903a70864 |
12 | 126b7479aaab5a |
13 | 5770277aa277b |
14 | 241623c340742 |
15 | 1006a036c541a |
hex | 763c9abebbf6 |
130002666306550 has 24 divisors (see below), whose sum is σ = 246367317058416. Its totient is φ = 51019914323040.
The previous prime is 130002666306533. The next prime is 130002666306553. The reversal of 130002666306550 is 55603666200031.
It is a junction number, because it is equal to n+sod(n) for n = 130002666306497 and 130002666306506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130002666306553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24528802314 + ... + 24528807613.
It is an arithmetic number, because the mean of its divisors is an integer number (10265304877434).
Almost surely, 2130002666306550 is an apocalyptic number.
130002666306550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130002666306550 is a deficient number, since it is larger than the sum of its proper divisors (116364650751866).
130002666306550 is a wasteful number, since it uses less digits than its factorization.
130002666306550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49057609992 (or 49057609987 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 43.
The spelling of 130002666306550 in words is "one hundred thirty trillion, two billion, six hundred sixty-six million, three hundred six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •