Base | Representation |
---|---|
bin | 1011111011110011011000… |
… | …0001000000000011010101 |
3 | 1201110110020220221221202012 |
4 | 2332330312001000003111 |
5 | 3204442410004240201 |
6 | 43524102235154005 |
7 | 2523015111616340 |
oct | 276746601000325 |
9 | 51413226857665 |
10 | 13122031321301 |
11 | 41aa027654651 |
12 | 157b1798a5905 |
13 | 74252c965346 |
14 | 33517705b457 |
15 | 17b502b3a5bb |
hex | bef360400d5 |
13122031321301 has 4 divisors (see below), whose sum is σ = 14996607224352. Its totient is φ = 11247455418252.
The previous prime is 13122031321247. The next prime is 13122031321313. The reversal of 13122031321301 is 10312313022131.
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 13122031321301 - 222 = 13122027126997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122031321901) 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, 937287951515 + ... + 937287951528.
It is an arithmetic number, because the mean of its divisors is an integer number (3749151806088).
Almost surely, 213122031321301 is an apocalyptic number.
It is an amenable number.
13122031321301 is a deficient number, since it is larger than the sum of its proper divisors (1874575903051).
13122031321301 is an equidigital number, since it uses as much as digits as its factorization.
13122031321301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1874575903050.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13122031321301 its reverse (10312313022131), we get a palindrome (23434344343432).
The spelling of 13122031321301 in words is "thirteen trillion, one hundred twenty-two billion, thirty-one million, three hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •