Base | Representation |
---|---|
bin | 1100000001001110001111… |
… | …0010100111101111010101 |
3 | 1201210100120220102210221221 |
4 | 3000103203302213233111 |
5 | 3213004102110204001 |
6 | 44034541345010341 |
7 | 2532522341650504 |
oct | 300234362475725 |
9 | 51710526383857 |
10 | 13215141100501 |
11 | 42355676a689a |
12 | 15952240239b1 |
13 | 74b24ab27852 |
14 | 33988ad7a83b |
15 | 17db51ee31a1 |
hex | c04e3ca7bd5 |
13215141100501 has 2 divisors, whose sum is σ = 13215141100502. Its totient is φ = 13215141100500.
The previous prime is 13215141100459. The next prime is 13215141100517. The reversal of 13215141100501 is 10500114151231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13037226704100 + 177914396401 = 3610710^2 + 421799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13215141100501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13215141100571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6607570550250 + 6607570550251.
It is an arithmetic number, because the mean of its divisors is an integer number (6607570550251).
Almost surely, 213215141100501 is an apocalyptic number.
It is an amenable number.
13215141100501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13215141100501 is an equidigital number, since it uses as much as digits as its factorization.
13215141100501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 25.
Adding to 13215141100501 its reverse (10500114151231), we get a palindrome (23715255251732).
The spelling of 13215141100501 in words is "thirteen trillion, two hundred fifteen billion, one hundred forty-one million, one hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •