Base | Representation |
---|---|
bin | 1100000011011011110101… |
… | …0100000001100000111101 |
3 | 1201220222200211100201110021 |
4 | 3000312331110001200331 |
5 | 3214114422431013234 |
6 | 44104225125012141 |
7 | 2535336263260531 |
oct | 300667524014075 |
9 | 51828624321407 |
10 | 13253150251069 |
11 | 424a6a1898223 |
12 | 15a0671254051 |
13 | 7519c75b7aa1 |
14 | 33b654d91bc1 |
15 | 17eb28d239b4 |
hex | c0dbd50183d |
13253150251069 has 2 divisors, whose sum is σ = 13253150251070. Its totient is φ = 13253150251068.
The previous prime is 13253150251051. The next prime is 13253150251093. The reversal of 13253150251069 is 96015205135231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13252235491044 + 914760025 = 3640362^2 + 30245^2 .
It is a cyclic number.
It is not a de Polignac number, because 13253150251069 - 235 = 13218790512701 is a prime.
It is a super-2 number, since 2×132531502510692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13253150251049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6626575125534 + 6626575125535.
It is an arithmetic number, because the mean of its divisors is an integer number (6626575125535).
Almost surely, 213253150251069 is an apocalyptic number.
It is an amenable number.
13253150251069 is a deficient number, since it is larger than the sum of its proper divisors (1).
13253150251069 is an equidigital number, since it uses as much as digits as its factorization.
13253150251069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243000, while the sum is 43.
The spelling of 13253150251069 in words is "thirteen trillion, two hundred fifty-three billion, one hundred fifty million, two hundred fifty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •