Base | Representation |
---|---|
bin | 1100000000011001100110… |
… | …0001100011110101101010 |
3 | 1201202000010002200022101122 |
4 | 3000012121201203311222 |
5 | 3212241132103242302 |
6 | 44024243235015242 |
7 | 2531512224251441 |
oct | 300063141436552 |
9 | 51660102608348 |
10 | 13201010212202 |
11 | 422a57612a30a |
12 | 159253b73a522 |
13 | 749b0837ba97 |
14 | 338d0a351d58 |
15 | 17d5c66583a2 |
hex | c0199863d6a |
13201010212202 has 8 divisors (see below), whose sum is σ = 19802174426496. Its totient is φ = 6600285403372.
The previous prime is 13201010212151. The next prime is 13201010212207. The reversal of 13201010212202 is 20221201010231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×132010102122022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13201010212207) 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, 109776248 + ... + 109896435.
It is an arithmetic number, because the mean of its divisors is an integer number (2475271803312).
Almost surely, 213201010212202 is an apocalyptic number.
13201010212202 is a deficient number, since it is larger than the sum of its proper divisors (6601164214294).
13201010212202 is a wasteful number, since it uses less digits than its factorization.
13201010212202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219702732.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 13201010212202 its reverse (20221201010231), we get a palindrome (33422211222433).
The spelling of 13201010212202 in words is "thirteen trillion, two hundred one billion, ten million, two hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •