Base | Representation |
---|---|
bin | 11000101001010000… |
… | …10000100111111111 |
3 | 1021011002110102222101 |
4 | 30110220100213333 |
5 | 204044114000223 |
6 | 10024522125531 |
7 | 645606434131 |
oct | 142450204777 |
9 | 37132412871 |
10 | 13231000063 |
11 | 567a6111a6 |
12 | 26930508a7 |
13 | 132b1c1228 |
14 | 8d72db051 |
15 | 5268814ad |
hex | 314a109ff |
13231000063 has 2 divisors, whose sum is σ = 13231000064. Its totient is φ = 13231000062.
The previous prime is 13231000061. The next prime is 13231000073. The reversal of 13231000063 is 36000013231.
13231000063 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 is a cyclic number.
It is not a de Polignac number, because 13231000063 - 21 = 13231000061 is a prime.
Together with 13231000061, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13231000063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13231000061) 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, 6615500031 + 6615500032.
It is an arithmetic number, because the mean of its divisors is an integer number (6615500032).
Almost surely, 213231000063 is an apocalyptic number.
13231000063 is a deficient number, since it is larger than the sum of its proper divisors (1).
13231000063 is an equidigital number, since it uses as much as digits as its factorization.
13231000063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13231000063 its reverse (36000013231), we get a palindrome (49231013294).
The spelling of 13231000063 in words is "thirteen billion, two hundred thirty-one million, sixty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •