Base | Representation |
---|---|
bin | 1011111010100110001110… |
… | …0101011110101101011111 |
3 | 1201101110210120212202110011 |
4 | 2332221203211132231133 |
5 | 3204123001140203203 |
6 | 43510355213424051 |
7 | 2521352643155023 |
oct | 276514345365537 |
9 | 51343716782404 |
10 | 13101321022303 |
11 | 41a126a191468 |
12 | 1577159a9b027 |
13 | 7405ac083657 |
14 | 3341706ba383 |
15 | 17abde86576d |
hex | bea6395eb5f |
13101321022303 has 4 divisors (see below), whose sum is σ = 13129617612448. Its totient is φ = 13073024432160.
The previous prime is 13101321022301. The next prime is 13101321022327. The reversal of 13101321022303 is 30322012310131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13101321022303 - 21 = 13101321022301 is a prime.
It is a super-2 number, since 2×131013210223032 (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 (13101321022301) 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, 14148294378 + ... + 14148295303.
It is an arithmetic number, because the mean of its divisors is an integer number (3282404403112).
Almost surely, 213101321022303 is an apocalyptic number.
13101321022303 is a deficient number, since it is larger than the sum of its proper divisors (28296590145).
13101321022303 is an equidigital number, since it uses as much as digits as its factorization.
13101321022303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28296590144.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13101321022303 its reverse (30322012310131), we get a palindrome (43423333332434).
The spelling of 13101321022303 in words is "thirteen trillion, one hundred one billion, three hundred twenty-one million, twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •