Base | Representation |
---|---|
bin | 1100000011011011110101… |
… | …0100000001100000101011 |
3 | 1201220222200211100201102121 |
4 | 3000312331110001200223 |
5 | 3214114422431013201 |
6 | 44104225125012111 |
7 | 2535336263260504 |
oct | 300667524014053 |
9 | 51828624321377 |
10 | 13253150251051 |
11 | 424a6a1898207 |
12 | 15a0671254037 |
13 | 7519c75b7a89 |
14 | 33b654d91bab |
15 | 17eb28d239a1 |
hex | c0dbd50182b |
13253150251051 has 2 divisors, whose sum is σ = 13253150251052. Its totient is φ = 13253150251050.
The previous prime is 13253150251049. The next prime is 13253150251069. The reversal of 13253150251051 is 15015205135231.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13253150251051 - 21 = 13253150251049 is a prime.
Together with 13253150251049, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 13253150250998 and 13253150251016.
It is not a weakly prime, because it can be changed into another prime (13253150251151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6626575125525 + 6626575125526.
It is an arithmetic number, because the mean of its divisors is an integer number (6626575125526).
Almost surely, 213253150251051 is an apocalyptic number.
13253150251051 is a deficient number, since it is larger than the sum of its proper divisors (1).
13253150251051 is an equidigital number, since it uses as much as digits as its factorization.
13253150251051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 13253150251051 its reverse (15015205135231), we get a palindrome (28268355386282).
The spelling of 13253150251051 in words is "thirteen trillion, two hundred fifty-three billion, one hundred fifty million, two hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •