Base | Representation |
---|---|
bin | 11001001011110110… |
… | …10100110000100001 |
3 | 1021220022112122201102 |
4 | 30211323110300201 |
5 | 210142412213101 |
6 | 10113410244145 |
7 | 656032251326 |
oct | 144573246041 |
9 | 37808478642 |
10 | 13521210401 |
11 | 5809409556 |
12 | 2754286655 |
13 | 137637211a |
14 | 923a82b4d |
15 | 5420a986b |
hex | 325ed4c21 |
13521210401 has 2 divisors, whose sum is σ = 13521210402. Its totient is φ = 13521210400.
The previous prime is 13521210397. The next prime is 13521210421. The reversal of 13521210401 is 10401212531.
It is an a-pointer prime, because the next prime (13521210421) can be obtained adding 13521210401 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12664126225 + 857084176 = 112535^2 + 29276^2 .
It is a cyclic number.
It is not a de Polignac number, because 13521210401 - 22 = 13521210397 is a prime.
It is a super-3 number, since 3×135212104013 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (13521210421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6760605200 + 6760605201.
It is an arithmetic number, because the mean of its divisors is an integer number (6760605201).
Almost surely, 213521210401 is an apocalyptic number.
It is an amenable number.
13521210401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13521210401 is an equidigital number, since it uses as much as digits as its factorization.
13521210401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 13521210401 its reverse (10401212531), we get a palindrome (23922422932).
The spelling of 13521210401 in words is "thirteen billion, five hundred twenty-one million, two hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •