Base | Representation |
---|---|
bin | 1011111010100001011000… |
… | …0001100001010010110010 |
3 | 1201101100102220022021112010 |
4 | 2332220112001201102302 |
5 | 3204112320024000231 |
6 | 43510022130543350 |
7 | 2521305462425304 |
oct | 276502601412262 |
9 | 51340386267463 |
10 | 13100019750066 |
11 | 41a07616a5367 |
12 | 1576a56137b56 |
13 | 7404325c1592 |
14 | 334089947974 |
15 | 17ab654c3546 |
hex | bea160614b2 |
13100019750066 has 8 divisors (see below), whose sum is σ = 26200039500144. Its totient is φ = 4366673250020.
The previous prime is 13100019750061. The next prime is 13100019750067. The reversal of 13100019750066 is 66005791000131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
13100019750066 is an admirable number.
It is a super-2 number, since 2×131000197500662 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13100019750061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1091668312500 + ... + 1091668312511.
It is an arithmetic number, because the mean of its divisors is an integer number (3275004937518).
Almost surely, 213100019750066 is an apocalyptic number.
13100019750066 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13100019750066 is a wasteful number, since it uses less digits than its factorization.
13100019750066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2183336625016.
The product of its (nonzero) digits is 34020, while the sum is 39.
The spelling of 13100019750066 in words is "thirteen trillion, one hundred billion, nineteen million, seven hundred fifty thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •