Base | Representation |
---|---|
bin | 1100000011011000101011… |
… | …1100001010001101000001 |
3 | 1201220220111221010100022221 |
4 | 3000312022330022031001 |
5 | 3214111210103300101 |
6 | 44104005215131041 |
7 | 2535306322015534 |
oct | 300661274121501 |
9 | 51826457110287 |
10 | 13252305134401 |
11 | 424a2a88415a3 |
12 | 15a0476213a81 |
13 | 7518c1499458 |
14 | 33b5b4a40a1b |
15 | 17eac9a38aa1 |
hex | c0d8af0a341 |
13252305134401 has 2 divisors, whose sum is σ = 13252305134402. Its totient is φ = 13252305134400.
The previous prime is 13252305134339. The next prime is 13252305134429. The reversal of 13252305134401 is 10443150325231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13037010062400 + 215295072001 = 3610680^2 + 463999^2 .
It is a cyclic number.
It is not a de Polignac number, because 13252305134401 - 237 = 13114866180929 is a prime.
It is a super-2 number, since 2×132523051344012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13252305144401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6626152567200 + 6626152567201.
It is an arithmetic number, because the mean of its divisors is an integer number (6626152567201).
Almost surely, 213252305134401 is an apocalyptic number.
It is an amenable number.
13252305134401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13252305134401 is an equidigital number, since it uses as much as digits as its factorization.
13252305134401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 13252305134401 its reverse (10443150325231), we get a palindrome (23695455459632).
The spelling of 13252305134401 in words is "thirteen trillion, two hundred fifty-two billion, three hundred five million, one hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •