Base | Representation |
---|---|
bin | 1100000111010101010000… |
… | …0001010101011111101111 |
3 | 1202011101111220012000011220 |
4 | 3001311110001111133233 |
5 | 3221214032411034411 |
6 | 44155100531314423 |
7 | 2543226401160342 |
oct | 301652401253757 |
9 | 52141456160156 |
10 | 13320103221231 |
11 | 427602a017714 |
12 | 15b163774ba13 |
13 | 7581076926b1 |
14 | 3409a703c459 |
15 | 181746ba0b06 |
hex | c1d540557ef |
13320103221231 has 16 divisors (see below), whose sum is σ = 18241381298784. Its totient is φ = 8639479609344.
The previous prime is 13320103221221. The next prime is 13320103221247. The reversal of 13320103221231 is 13212230102331.
It is not a de Polignac number, because 13320103221231 - 221 = 13320101124079 is a prime.
It is a super-2 number, since 2×133201032212312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320103221221) 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 15 ways as a sum of consecutive naturals, for example, 2435610 + ... + 5707223.
It is an arithmetic number, because the mean of its divisors is an integer number (1140086331174).
Almost surely, 213320103221231 is an apocalyptic number.
13320103221231 is a deficient number, since it is larger than the sum of its proper divisors (4921278077553).
13320103221231 is a wasteful number, since it uses less digits than its factorization.
13320103221231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8157610.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13320103221231 its reverse (13212230102331), we get a palindrome (26532333323562).
The spelling of 13320103221231 in words is "thirteen trillion, three hundred twenty billion, one hundred three million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.880 sec. • engine limits •