Base | Representation |
---|---|
bin | 1100001101111111001010… |
… | …0000000010111011111101 |
3 | 1202120022121121111011210021 |
4 | 3003133302200002323331 |
5 | 3230102203343042001 |
6 | 44323405325212141 |
7 | 2554414505143363 |
oct | 303376240027375 |
9 | 52508547434707 |
10 | 13434431221501 |
11 | 430a56820a454 |
12 | 160b823a01051 |
13 | 765b277337b4 |
14 | 346330d57633 |
15 | 1846d8c0dba1 |
hex | c37f2802efd |
13434431221501 has 2 divisors, whose sum is σ = 13434431221502. Its totient is φ = 13434431221500.
The previous prime is 13434431221499. The next prime is 13434431221559. The reversal of 13434431221501 is 10512213443431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13408054213401 + 26377008100 = 3661701^2 + 162410^2 .
It is a cyclic number.
It is not a de Polignac number, because 13434431221501 - 21 = 13434431221499 is a prime.
Together with 13434431221499, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13434431221901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6717215610750 + 6717215610751.
It is an arithmetic number, because the mean of its divisors is an integer number (6717215610751).
Almost surely, 213434431221501 is an apocalyptic number.
It is an amenable number.
13434431221501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13434431221501 is an equidigital number, since it uses as much as digits as its factorization.
13434431221501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 13434431221501 its reverse (10512213443431), we get a palindrome (23946644664932).
The spelling of 13434431221501 in words is "thirteen trillion, four hundred thirty-four billion, four hundred thirty-one million, two hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •