Base | Representation |
---|---|
bin | 1100000110110000110100… |
… | …0000111111000000111111 |
3 | 1202010110021020010002212121 |
4 | 3001230031000333000333 |
5 | 3221034014413342343 |
6 | 44150402202143411 |
7 | 2542432121235115 |
oct | 301541500770077 |
9 | 52113236102777 |
10 | 13310322012223 |
11 | 427196a85a605 |
12 | 15ab767ab1b67 |
13 | 75720910b562 |
14 | 340319d8dab5 |
15 | 18137310eaed |
hex | c1b0d03f03f |
13310322012223 has 8 divisors (see below), whose sum is σ = 13469917163360. Its totient is φ = 13151183500800.
The previous prime is 13310322012167. The next prime is 13310322012233. The reversal of 13310322012223 is 32221022301331.
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-13310322012223 is a prime.
It is a super-2 number, since 2×133103220122232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310322012233) 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, 114101283 + ... + 114217876.
It is an arithmetic number, because the mean of its divisors is an integer number (1683739645420).
Almost surely, 213310322012223 is an apocalyptic number.
13310322012223 is a deficient number, since it is larger than the sum of its proper divisors (159595151137).
13310322012223 is an equidigital number, since it uses as much as digits as its factorization.
13310322012223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228319857.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13310322012223 its reverse (32221022301331), we get a palindrome (45531344313554).
The spelling of 13310322012223 in words is "thirteen trillion, three hundred ten billion, three hundred twenty-two million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •