Base | Representation |
---|---|
bin | 1100000110010010010101… |
… | …1100110010110111101111 |
3 | 1202002200011011000111120112 |
4 | 3001210211130302313233 |
5 | 3220420241324133403 |
6 | 44142530352410235 |
7 | 2542022323404365 |
oct | 301444534626757 |
9 | 52080134014515 |
10 | 13302142021103 |
11 | 4269452426171 |
12 | 15aa06454697b |
13 | 7565044c8620 |
14 | 33db81831635 |
15 | 181044e0d9d8 |
hex | c1925732def |
13302142021103 has 8 divisors (see below), whose sum is σ = 14421527232000. Its totient is φ = 12196491598368.
The previous prime is 13302142021081. The next prime is 13302142021111. The reversal of 13302142021103 is 30112024120331.
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 13302142021103 - 218 = 13302141758959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13302142024103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3433695023 + ... + 3433698896.
It is an arithmetic number, because the mean of its divisors is an integer number (1802690904000).
Almost surely, 213302142021103 is an apocalyptic number.
13302142021103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13302142021103 is a deficient number, since it is larger than the sum of its proper divisors (1119385210897).
13302142021103 is a wasteful number, since it uses less digits than its factorization.
13302142021103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6867394081.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13302142021103 its reverse (30112024120331), we get a palindrome (43414166141434).
The spelling of 13302142021103 in words is "thirteen trillion, three hundred two billion, one hundred forty-two million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •