Base | Representation |
---|---|
bin | 1100000010001101110010… |
… | …1101010000000001110010 |
3 | 1201211222121220202110201021 |
4 | 3000203130231100001302 |
5 | 3213244022220340310 |
6 | 44050442325530054 |
7 | 2533665206150143 |
oct | 300433455200162 |
9 | 51758556673637 |
10 | 13232202121330 |
11 | 4241822153305 |
12 | 15985a587392a |
13 | 74ca3966474a |
14 | 33a628bc1aca |
15 | 17e2eec205da |
hex | c08dcb50072 |
13232202121330 has 64 divisors (see below), whose sum is σ = 25713579133440. Its totient is φ = 4887601083904.
The previous prime is 13232202121297. The next prime is 13232202121331. The reversal of 13232202121330 is 3312120223231.
It is a junction number, because it is equal to n+sod(n) for n = 13232202121295 and 13232202121304.
It is not an unprimeable number, because it can be changed into a prime (13232202121331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58630062 + ... + 58855318.
It is an arithmetic number, because the mean of its divisors is an integer number (401774673960).
Almost surely, 213232202121330 is an apocalyptic number.
13232202121330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13232202121330 is a deficient number, since it is larger than the sum of its proper divisors (12481377012110).
13232202121330 is a wasteful number, since it uses less digits than its factorization.
13232202121330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234123.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13232202121330 its reverse (3312120223231), we get a palindrome (16544322344561).
The spelling of 13232202121330 in words is "thirteen trillion, two hundred thirty-two billion, two hundred two million, one hundred twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •