Base | Representation |
---|---|
bin | 1100000000010110101100… |
… | …0101100100100100010110 |
3 | 1201201221002210200111020020 |
4 | 3000011223011210210112 |
5 | 3212233033131420342 |
6 | 44024034044250010 |
7 | 2531454014150133 |
oct | 300055305444426 |
9 | 51657083614206 |
10 | 13200231123222 |
11 | 422a206381220 |
12 | 1592362840906 |
13 | 749a12b3aba0 |
14 | 338c74aab58a |
15 | 17d57d0620ec |
hex | c016b164916 |
13200231123222 has 64 divisors (see below), whose sum is σ = 32364446317056. Its totient is φ = 3531834408960.
The previous prime is 13200231123181. The next prime is 13200231123271. The reversal of 13200231123222 is 22232113200231.
It is a super-2 number, since 2×132002311232222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13200231123192 and 13200231123201.
It is a congruent number.
It is an unprimeable number.
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, 334434283 + ... + 334473750.
It is an arithmetic number, because the mean of its divisors is an integer number (505694473704).
Almost surely, 213200231123222 is an apocalyptic number.
13200231123222 is an abundant number, since it is smaller than the sum of its proper divisors (19164215193834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200231123222 is a wasteful number, since it uses less digits than its factorization.
13200231123222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668908085.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 13200231123222 its reverse (22232113200231), we get a palindrome (35432344323453).
The spelling of 13200231123222 in words is "thirteen trillion, two hundred billion, two hundred thirty-one million, one hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •