Base | Representation |
---|---|
bin | 1100000000010110101100… |
… | …0101001011111000101010 |
3 | 1201201221002210111100112210 |
4 | 3000011223011023320222 |
5 | 3212233033120201442 |
6 | 44024034042145550 |
7 | 2531454013246314 |
oct | 300055305137052 |
9 | 51657083440483 |
10 | 13200231022122 |
11 | 422a206312271 |
12 | 15923627b22b6 |
13 | 749a12b03b71 |
14 | 338c74a827b4 |
15 | 17d57d04219c |
hex | c016b14be2a |
13200231022122 has 8 divisors (see below), whose sum is σ = 26400462044256. Its totient is φ = 4400077007372.
The previous prime is 13200231022087. The next prime is 13200231022123. The reversal of 13200231022122 is 22122013200231.
It is a sphenic number, since it is the product of 3 distinct primes.
13200231022122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (13200231022123) 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 3 ways as a sum of consecutive naturals, for example, 1100019251838 + ... + 1100019251849.
It is an arithmetic number, because the mean of its divisors is an integer number (3300057755532).
Almost surely, 213200231022122 is an apocalyptic number.
13200231022122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200231022122 is a wasteful number, since it uses less digits than its factorization.
13200231022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200038503692.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13200231022122 its reverse (22122013200231), we get a palindrome (35322244222353).
The spelling of 13200231022122 in words is "thirteen trillion, two hundred billion, two hundred thirty-one million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •