Base | Representation |
---|---|
bin | 1100001110011000111100… |
… | …1101110100110011000010 |
3 | 1202120222111011121200022120 |
4 | 3003212033031310303002 |
5 | 3230210343442411302 |
6 | 44330512355145110 |
7 | 2555051214036342 |
oct | 303461715646302 |
9 | 52528434550276 |
10 | 13441355435202 |
11 | 43124a0800712 |
12 | 16110368a5196 |
13 | 76668c123276 |
14 | 3467ca7c6d22 |
15 | 184991a579bc |
hex | c398f374cc2 |
13441355435202 has 8 divisors (see below), whose sum is σ = 26882710870416. Its totient is φ = 4480451811732.
The previous prime is 13441355435191. The next prime is 13441355435213. The reversal of 13441355435202 is 20253455314431.
13441355435202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13441355435191) and next prime (13441355435213).
It is a sphenic number, since it is the product of 3 distinct primes.
13441355435202 is an admirable number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1120112952928 + ... + 1120112952939.
It is an arithmetic number, because the mean of its divisors is an integer number (3360338858802).
Almost surely, 213441355435202 is an apocalyptic number.
13441355435202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13441355435202 is a wasteful number, since it uses less digits than its factorization.
13441355435202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2240225905872.
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 13441355435202 in words is "thirteen trillion, four hundred forty-one billion, three hundred fifty-five million, four hundred thirty-five thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •