Base | Representation |
---|---|
bin | 1011111011010101111010… |
… | …0010010010011010010101 |
3 | 1201102200211122200020000210 |
4 | 2332311132202102122111 |
5 | 3204330210011420201 |
6 | 43520313310000033 |
7 | 2522315101662111 |
oct | 276653642223225 |
9 | 51380748606023 |
10 | 13114121201301 |
11 | 41a673859639a |
12 | 15797307a6019 |
13 | 74186bc31673 |
14 | 334a266ac741 |
15 | 17b1dd4961d6 |
hex | bed5e892695 |
13114121201301 has 4 divisors (see below), whose sum is σ = 17485494935072. Its totient is φ = 8742747467532.
The previous prime is 13114121201297. The next prime is 13114121201333. The reversal of 13114121201301 is 10310212141131.
It is a happy number.
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 not a de Polignac number, because 13114121201301 - 22 = 13114121201297 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 (13114121201371) 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, 2185686866881 + ... + 2185686866886.
It is an arithmetic number, because the mean of its divisors is an integer number (4371373733768).
Almost surely, 213114121201301 is an apocalyptic number.
It is an amenable number.
13114121201301 is a deficient number, since it is larger than the sum of its proper divisors (4371373733771).
13114121201301 is an equidigital number, since it uses as much as digits as its factorization.
13114121201301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4371373733770.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 13114121201301 its reverse (10310212141131), we get a palindrome (23424333342432).
The spelling of 13114121201301 in words is "thirteen trillion, one hundred fourteen billion, one hundred twenty-one million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •