Base | Representation |
---|---|
bin | 1011111100010101001111… |
… | …0000011001110000010001 |
3 | 1201111022201100022220111102 |
4 | 2333011103300121300101 |
5 | 3210120013234034301 |
6 | 43532204153554145 |
7 | 2523456254161643 |
oct | 277052360316021 |
9 | 51438640286442 |
10 | 13131120221201 |
11 | 4202971045674 |
12 | 1580a95715955 |
13 | 74334a970918 |
14 | 33579a1b4893 |
15 | 17b885a27b6b |
hex | bf153c19c11 |
13131120221201 has 4 divisors (see below), whose sum is σ = 13702038491712. Its totient is φ = 12560201950692.
The previous prime is 13131120221147. The next prime is 13131120221213. The reversal of 13131120221201 is 10212202113131.
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 13131120221201 - 26 = 13131120221137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13131120221701) 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, 285459135221 + ... + 285459135266.
It is an arithmetic number, because the mean of its divisors is an integer number (3425509622928).
Almost surely, 213131120221201 is an apocalyptic number.
It is an amenable number.
13131120221201 is a deficient number, since it is larger than the sum of its proper divisors (570918270511).
13131120221201 is an equidigital number, since it uses as much as digits as its factorization.
13131120221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570918270510.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13131120221201 its reverse (10212202113131), we get a palindrome (23343322334332).
The spelling of 13131120221201 in words is "thirteen trillion, one hundred thirty-one billion, one hundred twenty million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •