Base | Representation |
---|---|
bin | 1100000110010010111110… |
… | …0001011100101101100111 |
3 | 1202002200120221000012011221 |
4 | 3001210233201130231213 |
5 | 3220421113104410343 |
6 | 44142555230441211 |
7 | 2542026444664651 |
oct | 301445741345547 |
9 | 52080527005157 |
10 | 13302311013223 |
11 | 426952985a481 |
12 | 15aa0b1063207 |
13 | 756530516c6b |
14 | 33db9a0616d1 |
15 | 181054b905ed |
hex | c192f85cb67 |
13302311013223 has 8 divisors (see below), whose sum is σ = 13884605762400. Its totient is φ = 12720344047488.
The previous prime is 13302311013221. The next prime is 13302311013241. The reversal of 13302311013223 is 32231011320331.
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 13302311013223 - 21 = 13302311013221 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 (13302311013221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81862918 + ... + 82025251.
It is an arithmetic number, because the mean of its divisors is an integer number (1735575720300).
Almost surely, 213302311013223 is an apocalyptic number.
13302311013223 is a deficient number, since it is larger than the sum of its proper divisors (582294749177).
13302311013223 is a wasteful number, since it uses less digits than its factorization.
13302311013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163891721.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13302311013223 its reverse (32231011320331), we get a palindrome (45533322333554).
The spelling of 13302311013223 in words is "thirteen trillion, three hundred two billion, three hundred eleven million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •