Base | Representation |
---|---|
bin | 1100000000011001111011… |
… | …1000001010000111001111 |
3 | 1201202000100100200010120201 |
4 | 3000012132320022013033 |
5 | 3212241323101202343 |
6 | 44024300203554331 |
7 | 2531514364523311 |
oct | 300063670120717 |
9 | 51660310603521 |
10 | 13201100022223 |
11 | 422a6118a0973 |
12 | 159256582b9a7 |
13 | 749b20b653c9 |
14 | 338d1824d7b1 |
15 | 17d5ce49894d |
hex | c019ee0a1cf |
13201100022223 has 8 divisors (see below), whose sum is σ = 13213417089600. Its totient is φ = 13188783588768.
The previous prime is 13201100022221. The next prime is 13201100022239. The reversal of 13201100022223 is 32222000110231.
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 13201100022223 - 21 = 13201100022221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13201100022223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201100022221) 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, 48428073 + ... + 48699901.
It is an arithmetic number, because the mean of its divisors is an integer number (1651677136200).
Almost surely, 213201100022223 is an apocalyptic number.
13201100022223 is a deficient number, since it is larger than the sum of its proper divisors (12317067377).
13201100022223 is a wasteful number, since it uses less digits than its factorization.
13201100022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316961.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 13201100022223 its reverse (32222000110231), we get a palindrome (45423100132454).
The spelling of 13201100022223 in words is "thirteen trillion, two hundred one billion, one hundred million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •