Base | Representation |
---|---|
bin | 1100000110010010010001… |
… | …0100010100011111101001 |
3 | 1202002200002211021021010122 |
4 | 3001210210110110133221 |
5 | 3220420221443203223 |
6 | 44142524433253025 |
7 | 2542022003045336 |
oct | 301444424243751 |
9 | 52080084237118 |
10 | 13302123022313 |
11 | 426944272a094 |
12 | 15aa05a104175 |
13 | 7565005a5b38 |
14 | 33db7d0c798d |
15 | 1810434095c8 |
hex | c19245147e9 |
13302123022313 has 8 divisors (see below), whose sum is σ = 13309106971776. Its totient is φ = 13295140578000.
The previous prime is 13302123022301. The next prime is 13302123022343. The reversal of 13302123022313 is 31322032120331.
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-13302123022313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13302123022343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17526770 + ... + 18269972.
It is an arithmetic number, because the mean of its divisors is an integer number (1663638371472).
Almost surely, 213302123022313 is an apocalyptic number.
It is an amenable number.
13302123022313 is a deficient number, since it is larger than the sum of its proper divisors (6983949463).
13302123022313 is an equidigital number, since it uses as much as digits as its factorization.
13302123022313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752575.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 13302123022313 its reverse (31322032120331), we get a palindrome (44624155142644).
The spelling of 13302123022313 in words is "thirteen trillion, three hundred two billion, one hundred twenty-three million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •