Base | Representation |
---|---|
bin | 1100000110001010010111… |
… | …0110101011000100000111 |
3 | 1202002110121221220200101210 |
4 | 3001202211312223010013 |
5 | 3220401400314234343 |
6 | 44141534122022503 |
7 | 2541615300636021 |
oct | 301424566530407 |
9 | 52073557820353 |
10 | 13300001321223 |
11 | 4268554019711 |
12 | 15a9767647a33 |
13 | 756252b5a4c6 |
14 | 33da1b3cd011 |
15 | 180e6c007333 |
hex | c18a5dab107 |
13300001321223 has 8 divisors (see below), whose sum is σ = 17831309322736. Its totient is φ = 8817680433600.
The previous prime is 13300001321093. The next prime is 13300001321273. The reversal of 13300001321223 is 32212310000331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13300001321223 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 13300001321223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300001321273) 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, 12246777838 + ... + 12246778923.
It is an arithmetic number, because the mean of its divisors is an integer number (2228913665342).
Almost surely, 213300001321223 is an apocalyptic number.
13300001321223 is a deficient number, since it is larger than the sum of its proper divisors (4531308001513).
13300001321223 is a wasteful number, since it uses less digits than its factorization.
13300001321223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24493556945.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13300001321223 its reverse (32212310000331), we get a palindrome (45512311321554).
The spelling of 13300001321223 in words is "thirteen trillion, three hundred billion, one million, three hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •