Base | Representation |
---|---|
bin | 1011111010101001100010… |
… | …1101100001011110011111 |
3 | 1201101120002201000112110122 |
4 | 2332222120231201132133 |
5 | 3204131312323320411 |
6 | 43511023453225155 |
7 | 2521414015123013 |
oct | 276523055413637 |
9 | 51346081015418 |
10 | 13102212323231 |
11 | 41a1687311aa9 |
12 | 15773684921bb |
13 | 7406c1922655 |
14 | 334216c10543 |
15 | 17ac42c249db |
hex | bea98b6179f |
13102212323231 has 16 divisors (see below), whose sum is σ = 13813513113600. Its totient is φ = 12409137779808.
The previous prime is 13102212323177. The next prime is 13102212323341. The reversal of 13102212323231 is 13232321220131.
It is a de Polignac number, because none of the positive numbers 2k-13102212323231 is a prime.
It is a super-2 number, since 2×131022123232312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13102212323231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102212373231) 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, 7477391 + ... + 9061776.
It is an arithmetic number, because the mean of its divisors is an integer number (863344569600).
Almost surely, 213102212323231 is an apocalyptic number.
13102212323231 is a deficient number, since it is larger than the sum of its proper divisors (711300790369).
13102212323231 is a wasteful number, since it uses less digits than its factorization.
13102212323231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16539718.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13102212323231 its reverse (13232321220131), we get a palindrome (26334533543362).
The spelling of 13102212323231 in words is "thirteen trillion, one hundred two billion, two hundred twelve million, three hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •