Base | Representation |
---|---|
bin | 1011111010101000110101… |
… | …1000011000100001000011 |
3 | 1201101112121110022220111112 |
4 | 2332222031120120201003 |
5 | 3204130420142412011 |
6 | 43510552543033535 |
7 | 2521406216305400 |
oct | 276521530304103 |
9 | 51345543286445 |
10 | 13102022232131 |
11 | 41a1599a87818 |
12 | 157731489b8ab |
13 | 740691427601 |
14 | 3341d988b2a7 |
15 | 17ac311c658b |
hex | bea8d618843 |
13102022232131 has 12 divisors (see below), whose sum is σ = 15241457977200. Its totient is φ = 11230061557680.
The previous prime is 13102022232109. The next prime is 13102022232191. The reversal of 13102022232131 is 13123222020131.
It is not a de Polignac number, because 13102022232131 - 214 = 13102022215747 is a prime.
It is a super-2 number, since 2×131020222321312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13102022232097 and 13102022232106.
It is not an unprimeable number, because it can be changed into a prime (13102022232191) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 591215 + ... + 5153016.
It is an arithmetic number, because the mean of its divisors is an integer number (1270121498100).
Almost surely, 213102022232131 is an apocalyptic number.
13102022232131 is a deficient number, since it is larger than the sum of its proper divisors (2139435745069).
13102022232131 is an equidigital number, since it uses as much as digits as its factorization.
13102022232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5790794 (or 5790787 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13102022232131 its reverse (13123222020131), we get a palindrome (26225244252262).
The spelling of 13102022232131 in words is "thirteen trillion, one hundred two billion, twenty-two million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •