Base | Representation |
---|---|
bin | 1100000001000010100011… |
… | …0000011111010010101111 |
3 | 1201210001111012221001202012 |
4 | 3000100220300133102233 |
5 | 3212431140304432343 |
6 | 44033302132551435 |
7 | 2532351520160150 |
oct | 300205060372257 |
9 | 51701435831665 |
10 | 13212003202223 |
11 | 42341a740a431 |
12 | 15946a918257b |
13 | 74ab6a9c07c7 |
14 | 339670319927 |
15 | 17da1b7b0718 |
hex | c0428c1f4af |
13212003202223 has 8 divisors (see below), whose sum is σ = 15099459868800. Its totient is φ = 11324553445080.
The previous prime is 13212003202171. The next prime is 13212003202231. The reversal of 13212003202223 is 32220230021231.
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 13212003202223 - 216 = 13212003136687 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 (13212003201223) 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, 3374888 + ... + 6149298.
It is an arithmetic number, because the mean of its divisors is an integer number (1887432483600).
Almost surely, 213212003202223 is an apocalyptic number.
13212003202223 is a deficient number, since it is larger than the sum of its proper divisors (1887456666577).
13212003202223 is an equidigital number, since it uses as much as digits as its factorization.
13212003202223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3454717.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 13212003202223 its reverse (32220230021231), we get a palindrome (45432233223454).
The spelling of 13212003202223 in words is "thirteen trillion, two hundred twelve billion, three million, two hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •