Base | Representation |
---|---|
bin | 1100000000011110111001… |
… | …0010000001001000011101 |
3 | 1201202010210012101211122111 |
4 | 3000013232102001020131 |
5 | 3212302040120414440 |
6 | 44025040313114021 |
7 | 2531562402046210 |
oct | 300075622011035 |
9 | 51663705354574 |
10 | 13202432201245 |
11 | 4230135877771 |
12 | 15928779b8911 |
13 | 749ca3b59111 |
14 | 339003149777 |
15 | 17d65b3e34ea |
hex | c01ee48121d |
13202432201245 has 8 divisors (see below), whose sum is σ = 18106192733184. Its totient is φ = 9053096366544.
The previous prime is 13202432201221. The next prime is 13202432201279. The reversal of 13202432201245 is 54210223420231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13202432201245 - 27 = 13202432201117 is a prime.
It is a Duffinian number.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 188606174269 + ... + 188606174338.
It is an arithmetic number, because the mean of its divisors is an integer number (2263274091648).
Almost surely, 213202432201245 is an apocalyptic number.
It is an amenable number.
13202432201245 is a deficient number, since it is larger than the sum of its proper divisors (4903760531939).
13202432201245 is an equidigital number, since it uses as much as digits as its factorization.
13202432201245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377212348619.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 13202432201245 its reverse (54210223420231), we get a palindrome (67412655621476).
The spelling of 13202432201245 in words is "thirteen trillion, two hundred two billion, four hundred thirty-two million, two hundred one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •