Base | Representation |
---|---|
bin | 1011111010100101011111… |
… | …0010111001001101100011 |
3 | 1201101110021210122221220111 |
4 | 2332221113302321031203 |
5 | 3204122100020242011 |
6 | 43510323425552151 |
7 | 2521345021621003 |
oct | 276512762711543 |
9 | 51343253587814 |
10 | 13101123212131 |
11 | 41a1178564789 |
12 | 15771037a5657 |
13 | 74057a0b5006 |
14 | 334152308003 |
15 | 17abcc2e0121 |
hex | bea57cb9363 |
13101123212131 has 8 divisors (see below), whose sum is σ = 13137094628624. Its totient is φ = 13065174793440.
The previous prime is 13101123212117. The next prime is 13101123212147. The reversal of 13101123212131 is 13121232110131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13101123212131 - 221 = 13101121114979 is a prime.
It is a super-2 number, since 2×131011232121312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13101123213131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4608240 + ... + 6887533.
It is an arithmetic number, because the mean of its divisors is an integer number (1642136828578).
Almost surely, 213101123212131 is an apocalyptic number.
13101123212131 is a deficient number, since it is larger than the sum of its proper divisors (35971416493).
13101123212131 is a wasteful number, since it uses less digits than its factorization.
13101123212131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11498901.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 13101123212131 its reverse (13121232110131), we get a palindrome (26222355322262).
The spelling of 13101123212131 in words is "thirteen trillion, one hundred one billion, one hundred twenty-three million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •