Base | Representation |
---|---|
bin | 1100000000100001011001… |
… | …0001101110001010111111 |
3 | 1201202012111222000201122221 |
4 | 3000020112101232022333 |
5 | 3212304423410242343 |
6 | 44025231043150211 |
7 | 2531615130412351 |
oct | 300102621561277 |
9 | 51665458021587 |
10 | 13203103212223 |
11 | 423044a6171a1 |
12 | 1592a24675367 |
13 | 74a07cb88732 |
14 | 3390682d90d1 |
15 | 17d69a28b5ed |
hex | c021646e2bf |
13203103212223 has 8 divisors (see below), whose sum is σ = 13630277572736. Its totient is φ = 12776008089600.
The previous prime is 13203103212217. The next prime is 13203103212253. The reversal of 13203103212223 is 32221230130231.
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 13203103212223 - 229 = 13202566341311 is a prime.
It is a super-2 number, since 2×132031032122232 (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 (13203103212253) 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, 19470738 + ... + 20137423.
It is an arithmetic number, because the mean of its divisors is an integer number (1703784696592).
Almost surely, 213203103212223 is an apocalyptic number.
13203103212223 is a deficient number, since it is larger than the sum of its proper divisors (427174360513).
13203103212223 is a wasteful number, since it uses less digits than its factorization.
13203103212223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39618945.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13203103212223 its reverse (32221230130231), we get a palindrome (45424333342454).
The spelling of 13203103212223 in words is "thirteen trillion, two hundred three billion, one hundred three million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •