Base | Representation |
---|---|
bin | 1011111010101001100100… |
… | …1010110011111100000111 |
3 | 1201101120010020110121102121 |
4 | 2332222121022303330013 |
5 | 3204131321310013111 |
6 | 43511024325550411 |
7 | 2521414140311200 |
oct | 276523112637407 |
9 | 51346106417377 |
10 | 13102220001031 |
11 | 41a1690686497 |
12 | 157736ab75407 |
13 | 7406c33b0225 |
14 | 334217c4c5a7 |
15 | 17ac4373e871 |
hex | bea992b3f07 |
13102220001031 has 48 divisors (see below), whose sum is σ = 15553080483840. Its totient is φ = 11003130028800.
The previous prime is 13102220001029. The next prime is 13102220001077. The reversal of 13102220001031 is 13010002220131.
It is not a de Polignac number, because 13102220001031 - 21 = 13102220001029 is a prime.
It is a super-2 number, since 2×131022200010312 (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 = 13102220000996 and 13102220001014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102220001631) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 571065546 + ... + 571088488.
It is an arithmetic number, because the mean of its divisors is an integer number (324022510080).
Almost surely, 213102220001031 is an apocalyptic number.
13102220001031 is a deficient number, since it is larger than the sum of its proper divisors (2450860482809).
13102220001031 is a wasteful number, since it uses less digits than its factorization.
13102220001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24164 (or 24157 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13102220001031 its reverse (13010002220131), we get a palindrome (26112222221162).
The spelling of 13102220001031 in words is "thirteen trillion, one hundred two billion, two hundred twenty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •