Base | Representation |
---|---|
bin | 11000101010100101… |
… | …11111000101010001 |
3 | 1021011212112110221201 |
4 | 30111102333011101 |
5 | 204110000403101 |
6 | 10030002151201 |
7 | 646103563153 |
oct | 142522770521 |
9 | 37155473851 |
10 | 13242200401 |
11 | 5685971181 |
12 | 2696952501 |
13 | 1330613251 |
14 | 8d89b4ad3 |
15 | 527844e01 |
hex | 3154bf151 |
13242200401 has 2 divisors, whose sum is σ = 13242200402. Its totient is φ = 13242200400.
The previous prime is 13242200399. The next prime is 13242200449. The reversal of 13242200401 is 10400224231.
13242200401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13059004176 + 183196225 = 114276^2 + 13535^2 .
It is a cyclic number.
It is not a de Polignac number, because 13242200401 - 21 = 13242200399 is a prime.
Together with 13242200399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13242200471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6621100200 + 6621100201.
It is an arithmetic number, because the mean of its divisors is an integer number (6621100201).
Almost surely, 213242200401 is an apocalyptic number.
It is an amenable number.
13242200401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13242200401 is an equidigital number, since it uses as much as digits as its factorization.
13242200401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 13242200401 its reverse (10400224231), we get a palindrome (23642424632).
The spelling of 13242200401 in words is "thirteen billion, two hundred forty-two million, two hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •