Base | Representation |
---|---|
bin | 1100000111010110000011… |
… | …1100101010011101111111 |
3 | 1202011102002000021121020011 |
4 | 3001311200330222131333 |
5 | 3221220003421201343 |
6 | 44155134240004051 |
7 | 2543234643464533 |
oct | 301654074523577 |
9 | 52142060247204 |
10 | 13320320100223 |
11 | 4276130489054 |
12 | 15b1698300627 |
13 | 7581405a9666 |
14 | 3409c7b75bc3 |
15 | 18175ac4129d |
hex | c1d60f2a77f |
13320320100223 has 8 divisors (see below), whose sum is σ = 13649992188336. Its totient is φ = 12990875928000.
The previous prime is 13320320100211. The next prime is 13320320100229. The reversal of 13320320100223 is 32200102302331.
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-13320320100223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13320320100194 and 13320320100203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320320100229) 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, 56860636 + ... + 57094417.
It is an arithmetic number, because the mean of its divisors is an integer number (1706249023542).
Almost surely, 213320320100223 is an apocalyptic number.
13320320100223 is a deficient number, since it is larger than the sum of its proper divisors (329672088113).
13320320100223 is a wasteful number, since it uses less digits than its factorization.
13320320100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113957945.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 13320320100223 its reverse (32200102302331), we get a palindrome (45520422402554).
The spelling of 13320320100223 in words is "thirteen trillion, three hundred twenty billion, three hundred twenty million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •