Base | Representation |
---|---|
bin | 1100000110001110100101… |
… | …0000110000010110100111 |
3 | 1202002120112202220220110221 |
4 | 3001203221100300112213 |
5 | 3220411204322411403 |
6 | 44142242241225211 |
7 | 2541655312343212 |
oct | 301435120602647 |
9 | 52076482826427 |
10 | 13301132232103 |
11 | 4268a84426801 |
12 | 15a9a22332207 |
13 | 7563a3241941 |
14 | 33dac7696779 |
15 | 180ed6446dbd |
hex | c18e94305a7 |
13301132232103 has 32 divisors (see below), whose sum is σ = 13984639580160. Its totient is φ = 12641269509120.
The previous prime is 13301132232083. The next prime is 13301132232107. The reversal of 13301132232103 is 30123223110331.
It is a cyclic number.
It is not a de Polignac number, because 13301132232103 - 29 = 13301132231591 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301132232107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61663543 + ... + 61878871.
It is an arithmetic number, because the mean of its divisors is an integer number (437019986880).
Almost surely, 213301132232103 is an apocalyptic number.
13301132232103 is a deficient number, since it is larger than the sum of its proper divisors (683507348057).
13301132232103 is a wasteful number, since it uses less digits than its factorization.
13301132232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215727.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13301132232103 its reverse (30123223110331), we get a palindrome (43424355342434).
The spelling of 13301132232103 in words is "thirteen trillion, three hundred one billion, one hundred thirty-two million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •