Base | Representation |
---|---|
bin | 1100000110110000010111… |
… | …0000010011101111000010 |
3 | 1202010102221201220102002121 |
4 | 3001230011300103233002 |
5 | 3221033242222401010 |
6 | 44150342131234454 |
7 | 2542426111655611 |
oct | 301540560235702 |
9 | 52112851812077 |
10 | 13310200200130 |
11 | 4271908020359 |
12 | 15ab733148a2a |
13 | 7571b9acb8b2 |
14 | 340307b21878 |
15 | 18136759c3da |
hex | c1b05c13bc2 |
13310200200130 has 8 divisors (see below), whose sum is σ = 23958360360252. Its totient is φ = 5324080080048.
The previous prime is 13310200200079. The next prime is 13310200200151. The reversal of 13310200200130 is 3100200201331.
It can be written as a sum of positive squares in 2 ways, for example, as 11624874363729 + 1685325836401 = 3409527^2 + 1298201^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×133102002001302 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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, 665510009997 + ... + 665510010016.
Almost surely, 213310200200130 is an apocalyptic number.
13310200200130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13310200200130 is a deficient number, since it is larger than the sum of its proper divisors (10648160160122).
13310200200130 is a wasteful number, since it uses less digits than its factorization.
13310200200130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331020020020.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13310200200130 its reverse (3100200201331), we get a palindrome (16410400401461).
The spelling of 13310200200130 in words is "thirteen trillion, three hundred ten billion, two hundred million, two hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •