Base | Representation |
---|---|
bin | 1100000110101111111111… |
… | …1110010010100110100010 |
3 | 1202010102200222101101222001 |
4 | 3001223333332102212202 |
5 | 3221033042404432320 |
6 | 44150324344234214 |
7 | 2542423523336053 |
oct | 301537776224642 |
9 | 52112628341861 |
10 | 13310103202210 |
11 | 427186829a391 |
12 | 15ab70676b96a |
13 | 7571a2999689 |
14 | 3402d8cb272a |
15 | 18135dcdc20a |
hex | c1afff929a2 |
13310103202210 has 8 divisors (see below), whose sum is σ = 23958185763996. Its totient is φ = 5324041280880.
The previous prime is 13310103202181. The next prime is 13310103202219. The reversal of 13310103202210 is 1220230101331.
It can be written as a sum of positive squares in 2 ways, for example, as 11395978378849 + 1914124823361 = 3375793^2 + 1383519^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×133101032022102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13310103202219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 665505160101 + ... + 665505160120.
Almost surely, 213310103202210 is an apocalyptic number.
13310103202210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13310103202210 is a deficient number, since it is larger than the sum of its proper divisors (10648082561786).
13310103202210 is a wasteful number, since it uses less digits than its factorization.
13310103202210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331010320228.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13310103202210 its reverse (1220230101331), we get a palindrome (14530333303541).
The spelling of 13310103202210 in words is "thirteen trillion, three hundred ten billion, one hundred three million, two hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •