Base | Representation |
---|---|
bin | 1011111010100101011111… |
… | …0010111001001100111101 |
3 | 1201101110021210122221212002 |
4 | 2332221113302321030331 |
5 | 3204122100020241333 |
6 | 43510323425552045 |
7 | 2521345021620620 |
oct | 276512762711475 |
9 | 51343253587762 |
10 | 13101123212093 |
11 | 41a1178564754 |
12 | 15771037a5625 |
13 | 74057a0b4ca7 |
14 | 334152307db7 |
15 | 17abcc2e00e8 |
hex | bea57cb933d |
13101123212093 has 4 divisors (see below), whose sum is σ = 14972712242400. Its totient is φ = 11229534181788.
The previous prime is 13101123212087. The next prime is 13101123212117. The reversal of 13101123212093 is 39021232110131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13101123212093 - 26 = 13101123212029 is a prime.
It is a super-2 number, since 2×131011232120932 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101123212393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 935794515143 + ... + 935794515156.
It is an arithmetic number, because the mean of its divisors is an integer number (3743178060600).
Almost surely, 213101123212093 is an apocalyptic number.
It is an amenable number.
13101123212093 is a deficient number, since it is larger than the sum of its proper divisors (1871589030307).
13101123212093 is an equidigital number, since it uses as much as digits as its factorization.
13101123212093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871589030306.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 13101123212093 in words is "thirteen trillion, one hundred one billion, one hundred twenty-three million, two hundred twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •