Base | Representation |
---|---|
bin | 1100001000100001000000… |
… | …1100111000000100001001 |
3 | 1202020100000012212012120102 |
4 | 3002020100030320010021 |
5 | 3222032210144412301 |
6 | 44212302540135145 |
7 | 2544546355002455 |
oct | 302102014700411 |
9 | 52210005765512 |
10 | 13340440232201 |
11 | 42837157a9aa5 |
12 | 15b55725374b5 |
13 | 759cc8b262b4 |
14 | 341975dad665 |
15 | 1820372dbb6b |
hex | c2210338109 |
13340440232201 has 8 divisors (see below), whose sum is σ = 13427709803904. Its totient is φ = 13253199757200.
The previous prime is 13340440232191. The next prime is 13340440232237. The reversal of 13340440232201 is 10223204404331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13340440232201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13340440238201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6353825 + ... + 8188526.
It is an arithmetic number, because the mean of its divisors is an integer number (1678463725488).
Almost surely, 213340440232201 is an apocalyptic number.
It is an amenable number.
13340440232201 is a deficient number, since it is larger than the sum of its proper divisors (87269571703).
13340440232201 is a wasteful number, since it uses less digits than its factorization.
13340440232201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14548351.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 13340440232201 its reverse (10223204404331), we get a palindrome (23563644636532).
The spelling of 13340440232201 in words is "thirteen trillion, three hundred forty billion, four hundred forty million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •