Base | Representation |
---|---|
bin | 1100000000011110000100… |
… | …0010110110111001000010 |
3 | 1201202010012201112010000112 |
4 | 3000013201002312321002 |
5 | 3212301111242421310 |
6 | 44025002301151322 |
7 | 2531554034316554 |
oct | 300074102667102 |
9 | 51663181463015 |
10 | 13202210123330 |
11 | 42300314852a8 |
12 | 159281555b542 |
13 | 749c69b41977 |
14 | 338dc185b4d4 |
15 | 17d646b77705 |
hex | c01e10b6e42 |
13202210123330 has 48 divisors (see below), whose sum is σ = 25311768177960. Its totient is φ = 4956918355968.
The previous prime is 13202210123327. The next prime is 13202210123369. The reversal of 13202210123330 is 3332101220231.
It can be written as a sum of positive squares in 12 ways, for example, as 2696981778001 + 10505228345329 = 1642249^2 + 3241177^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13202210123296 and 13202210123305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5045675 + ... + 7201614.
Almost surely, 213202210123330 is an apocalyptic number.
13202210123330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13202210123330 is a deficient number, since it is larger than the sum of its proper divisors (12109558054630).
13202210123330 is a wasteful number, since it uses less digits than its factorization.
13202210123330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12247703 (or 12247686 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13202210123330 its reverse (3332101220231), we get a palindrome (16534311343561).
The spelling of 13202210123330 in words is "thirteen trillion, two hundred two billion, two hundred ten million, one hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •