Base | Representation |
---|---|
bin | 1100001110101000011011… |
… | …1000010000010010011001 |
3 | 1202121101012202011101002221 |
4 | 3003222012320100102121 |
5 | 3230242401143431301 |
6 | 44332440545224041 |
7 | 2555256166543051 |
oct | 303520670202231 |
9 | 52541182141087 |
10 | 13445510530201 |
11 | 4314233197022 |
12 | 16119b6332021 |
13 | 766ba1c08969 |
14 | 346aa2590561 |
15 | 184b36716da1 |
hex | c3a86e10499 |
13445510530201 has 4 divisors (see below), whose sum is σ = 13526022569472. Its totient is φ = 13364998490932.
The previous prime is 13445510530187. The next prime is 13445510530213. The reversal of 13445510530201 is 10203501554431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13445510530201 - 213 = 13445510522009 is a prime.
It is a super-2 number, since 2×134455105302012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13445510530801) 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, 40256019385 + ... + 40256019718.
It is an arithmetic number, because the mean of its divisors is an integer number (3381505642368).
Almost surely, 213445510530201 is an apocalyptic number.
It is an amenable number.
13445510530201 is a deficient number, since it is larger than the sum of its proper divisors (80512039271).
13445510530201 is an equidigital number, since it uses as much as digits as its factorization.
13445510530201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80512039270.
The product of its (nonzero) digits is 36000, while the sum is 34.
The spelling of 13445510530201 in words is "thirteen trillion, four hundred forty-five billion, five hundred ten million, five hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •