Base | Representation |
---|---|
bin | 1100000000011110000100… |
… | …1010110100111001101011 |
3 | 1201202010012212110020120221 |
4 | 3000013201022310321223 |
5 | 3212301112311243311 |
6 | 44025002414030511 |
7 | 2531554061140132 |
oct | 300074112647153 |
9 | 51663185406527 |
10 | 13202212212331 |
11 | 423003268184a |
12 | 15928161a8437 |
13 | 749c6a3c376c |
14 | 338dc1c42919 |
15 | 17d646e3b671 |
hex | c01e12b4e6b |
13202212212331 has 16 divisors (see below), whose sum is σ = 13668562483200. Its totient is φ = 12738397947840.
The previous prime is 13202212212281. The next prime is 13202212212377. The reversal of 13202212212331 is 13321221220231.
It is a cyclic number.
It is not a de Polignac number, because 13202212212331 - 211 = 13202212210283 is a prime.
It is a super-2 number, since 2×132022122123312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13202212212296 and 13202212212305.
It is not an unprimeable number, because it can be changed into a prime (13202212212731) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 139438695 + ... + 139533343.
It is an arithmetic number, because the mean of its divisors is an integer number (854285155200).
Almost surely, 213202212212331 is an apocalyptic number.
13202212212331 is a deficient number, since it is larger than the sum of its proper divisors (466350270869).
13202212212331 is a wasteful number, since it uses less digits than its factorization.
13202212212331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107994.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13202212212331 its reverse (13321221220231), we get a palindrome (26523433432562).
The spelling of 13202212212331 in words is "thirteen trillion, two hundred two billion, two hundred twelve million, two hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •