Base | Representation |
---|---|
bin | 1100000111010101010110… |
… | …1011101100011000001111 |
3 | 1202011101120211122111201020 |
4 | 3001311111223230120033 |
5 | 3221214112030232343 |
6 | 44155103405045223 |
7 | 2543230160152131 |
oct | 301652553543017 |
9 | 52141524574636 |
10 | 13320131102223 |
11 | 4276043830060 |
12 | 15b1644b56813 |
13 | 7581103a501a |
14 | 3409aaa19051 |
15 | 18174935bb83 |
hex | c1d55aec60f |
13320131102223 has 32 divisors (see below), whose sum is σ = 19868379840000. Its totient is φ = 7869676953600.
The previous prime is 13320131102221. The next prime is 13320131102269. The reversal of 13320131102223 is 32220113102331.
It is not a de Polignac number, because 13320131102223 - 21 = 13320131102221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320131102193 and 13320131102202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320131102221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31730098 + ... + 32147151.
It is an arithmetic number, because the mean of its divisors is an integer number (620886870000).
Almost surely, 213320131102223 is an apocalyptic number.
13320131102223 is a deficient number, since it is larger than the sum of its proper divisors (6548248737777).
13320131102223 is a wasteful number, since it uses less digits than its factorization.
13320131102223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63877423.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13320131102223 its reverse (32220113102331), we get a palindrome (45540244204554).
The spelling of 13320131102223 in words is "thirteen trillion, three hundred twenty billion, one hundred thirty-one million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •